3008 search results - page 84 / 602 » Independence in connected graphs |
103
click to vote
EUROPAR
2004
Springer
15 years 6 months ago
2004
Springer
Computing a spanning tree and the connected components of a graph are basic problems in Graph Theory and arise as subproblems in many applications. Dehne et al. present a BSP/CGM a...
117
click to vote
APWEB
2010
Springer
15 years 4 months ago
2010
Springer
To help users answer the question, what is the relation between (real world) entities or concepts, we might need to go well beyond the borders of traditional information retrieval ...
106
click to vote
ISAAC
2005
Springer
15 years 6 months ago
2005
Springer
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
105
click to vote
ICALP
2007
Springer
15 years 7 months ago
2007
Springer
This paper studies labeling schemes for the vertex connectivity function on general graphs. We consider the problem of labeling the nodes of any n-node graph is such a way that gi...
131
Voted
SIAMJO
2008
15 years 28 days ago
2008
Eigenvectors to the second smallest eigenvalue of the Laplace matrix of a graph, also known as Fiedler vectors, are the basic ingredient in spectral graph partitioning heuristics....