4865 search results - page 145 / 973 » The Complexity of Graph Connectivity |
143
click to vote
JDA
2010
15 years 1 months ago
2010
: Hierarchical graphs are graphs with layering structures; clustered graphs are graphs with recursive clustering structures. Both have applications in VLSI design, CASE tools, soft...
151
Voted
MFCS
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
100
click to vote
DM
2008
15 years 3 months ago
2008
For a simple graph G let NG(u) be the (open) neighborhood of vertex u V (G). Then G is neighborhood anti-Sperner (NAS) if for every u there is a v V (G)\{u} with NG(u) NG(v). A...
149
click to vote
SPAA
2009
ACM
15 years 10 months ago
2009
ACM
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
116
Voted
DIMACS
2001
15 years 4 months ago
2001
The notion of relative closure (X, Y )0 of a semi-Pfaffian couple (X, Y ) was introduced by Gabrielov to give a description of the o-minimal structure generated by Pfaffian functio...