171 search results - page 16 / 35 » Algorithms for Single-Source Vertex Connectivity |
SODA
2008
ACM
14 years 11 months ago
2008
ACM
Given a point set P in the plane, the Delaunay graph with respect to axis-parallel rectangles is a graph defined on the vertex set P, whose two points p, q P are connected by an ...
3DPVT
2002
IEEE
15 years 2 months ago
2002
IEEE
Almost all triangle mesh compression algorithms to date are driven by the mesh connectivity code. The geometry code usually employs a straightforward prediction method applied to ...
100
click to vote
FOCS
2007
IEEE
15 years 3 months ago
2007
IEEE
We describe a deterministic, polynomial time algorithm for finding edge-disjoint paths connecting given pairs of vertices in an expander. Specifically, the input of the algorith...
COCOON
2006
Springer
15 years 1 months ago
2006
Springer
: Inferring graphs from path frequency has been studied as an important problem which has a potential application to drug design and elucidation of chemical structures. Given a mul...
76
Voted
SODA
1997
ACM
14 years 10 months ago
1997
ACM
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...