7 search results - page 1 / 2 » Certificates and Fast Algorithms for Biconnectivity in Fully... |
ESA
1995
Springer
13 years 8 months ago
1995
Springer
DAM
2006
13 years 4 months ago
2006
This paper presents an optimal fully dynamic recognition algorithm for directed cographs. Given the modular decomposition tree of a directed cograph G, the algorithm supports arc ...
HIS
2009
13 years 2 months ago
2009
Abstract--The generalized minimum vertex-biconnected network problem plays an important role in the design of survivable backbone networks that should be fault tolerant to single c...
IPPS
2005
IEEE
13 years 10 months ago
2005
IEEE
We present an experimental study of parallel biconnected components algorithms employing several fundamental parallel primitives, e.g., prefix sum, list ranking, sorting, connect...
ESA
1999
Springer
13 years 9 months ago
1999
Springer
We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property π is called a π-graph. If π satis...