171 search results - page 11 / 35 » Algorithms for Single-Source Vertex Connectivity |
PG
1999
IEEE
15 years 1 months ago
1999
IEEE
In this paper we introduce a new compression technique for the connectivity of a Triangulated Irregular Network (TIN) by using Delaunay triangulation. The strategy in this paper i...
COCO
2007
Springer
15 years 3 months ago
2007
Springer
We present a deterministic logspace algorithm for solving S-T Connectivity on directed graphs if (i) we are given a stationary distribution of the random walk on the graph in whic...
VIS
2004
IEEE
15 years 10 months ago
2004
IEEE
We present a fast, topology-preserving approach for isosurface simplification. The underlying concept behind our approach is to preserve the disconnected surface components in cel...
ISAAC
2007
Springer
15 years 3 months ago
2007
Springer
The problem of maintaining a representation of a dynamic graph as long as a certain property is satisfied has recently been considered for a number of properties. This paper prese...
100
click to vote
SWAT
2004
Springer
15 years 2 months ago
2004
Springer
We study the following problem: Given a set V of n vertices and a set E of m edge pairs, we define a graph family G(V, E) as the set of graphs that have vertex set V and contain ...