171 search results - page 26 / 35 » Algorithms for Single-Source Vertex Connectivity |
WCRE
2000
IEEE
15 years 1 months ago
2000
IEEE
Component recovery supports program understanding, architecture recovery, and re-use. Among the best known techniques for detection of re-usable objects (related global variables ...
GD
1998
Springer
15 years 1 months ago
1998
Springer
We consider the problem of visualizing interconnections in railway systems. Given time tables from systems with thousands of trains, we are to visualize basic properties of the co...
BILDMED
2006
14 years 11 months ago
2006
Abstract. The proposed algorithm has been developed as a pre-processing tool for inflating cortical surface meshes, which have been created using segmentation and subsequent triang...
116
Voted
CGF
2011
14 years 1 months ago
2011
The SQuad data structure represents the connectivity of a triangle mesh by its “S table” of about 2 rpt (integer references per triangle). Yet it allows for a simple implement...
101
click to vote
ALGORITHMICA
2008
14 years 9 months ago
2008
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...