4865 search results - page 88 / 973 » The Complexity of Graph Connectivity |
EUROPAR
2004
Springer
14 years 3 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...
APWEB
2010
Springer
14 years 1 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 ...
ISAAC
2005
Springer
14 years 3 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 ...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
Incorporating probabilities into the semantics of incomplete databases has posed many challenges, forcing systems to sacrifice modeling power, scalability, or treatment of relatio...
TCAD
2008
13 years 10 months ago
2008
Given a set of pins and a set of obstacles on a plane, an obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) connects these pins, possibly through some additional points (...