4865 search results - page 358 / 973 » The Complexity of Graph Connectivity |
164
click to vote
GC
2006
Springer
15 years 6 months ago
2006
Springer
A map is a connected topological graph cellularly embedded in a surface. For a given graph , its genus distribution of rooted maps and embeddings on orientable and non-orientable s...
178
click to vote
COMBINATORICA
2007
15 years 6 months ago
2007
A complete partition of a graph G is a partition of its vertex set in which any two distinct classes are connected by an edge. Let cp(G) denote the maximum number of classes in a ...
179
click to vote
COMBINATORICA
2010
15 years 4 months ago
2010
Consider the following one-player game. The vertices of a random graph on n vertices are revealed to the player one by one. In each step, also all edges connecting the newly reveal...
198
click to vote
ALGORITHMICA
2011
15 years 1 months ago
2011
We show that computing the crossing number and the odd crossing number of a graph with a given rotation system is NP-complete. As a consequence we can show that many of the well-k...
175
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
Semi-supervised clustering algorithms aim to improve clustering results using limited supervision. The supervision is generally given as pairwise constraints; such constraints are...