A linear-time algorithm for finding a sparsek-connected spanning subgraph of ak-connected graph
Hiroshi Nagamochi(Kyoto University), Toshihide Ibaraki(Kyoto University)
Cited by 365
Abstract
Related Papers
No related papers found
Powered by citation graph analysis