Fully Dynamic Biconnectivity in Graphs", Algorithmica 13 (1995) [1 citations — 1 self]
by M. Ranch Henzinger, H. La Poutr
Proc. 33rd Annual Symp. on Foundations of Computer Science
http://csr.uvic.ca/~val/Publications/STOC95--RandDynConn.ps
Add To MetaCart
Abstract:
[15] H. Nagamochi and T. Ibaraki, "Linear time algo-rithms for finding a sparse k-connected spanning subgraph of a k-connected graph", Algorithmlea
Citations
No citations identified.

