Sciweavers

11381 search results - page 287 / 2277
» Connectivity
Sort
View
DAGSTUHL
2006
15 years 8 months ago
New Algebraic Tools for Constraint Satisfaction
Abstract. The Galois connection involving polymorphisms and coclones has received a lot of attention in regard to constraint satisfaction problems. However, it fails if we are inte...
Henning Schnoor, Ilka Schnoor
NIPS
1996
15 years 8 months ago
Salient Contour Extraction by Temporal Binding in a Cortically-based Network
It has been suggested that long-range intrinsic connections in striate cortex may play a role in contour extraction (Gilbert et al., 1996). A number of recent physiological and ps...
Shih-Cheng Yen, Leif H. Finkel
DM
2008
95views more  DM 2008»
15 years 6 months ago
Forbidden subgraphs and the existence of paths and cycles passing through specified vertices
In [2], Duffus et al. showed that every connected graph G which contains no induced subgraph isomorphic to a claw or a net is traceable. And they also showed that if a 2-connected...
Jun Fujisawa, Katsuhiro Ota, Takeshi Sugiyama, Mas...
LMCS
2006
119views more  LMCS 2006»
15 years 6 months ago
The monadic second-order logic of graphs XVI : Canonical graph decompositions
This article establishes that the split decomposition of graphs introduced by Cunnigham, is definable in Monadic Second-Order Logic.This result is actually an instance of a more ge...
Bruno Courcelle