A linear-time algorithm for finding a sparsek-connected spanning subgraph of ak-connected graph
Algorithmica1992Vol. 7(1-6), pp. 583–596
Citations Over TimeTop 1% of 1992 papers
Related Papers
- → Applications of Structural Equivalence to Subgraph Isomorphism on Multichannel Multigraphs(2019)9 cited
- → The Problem of the Maximal K-Subgraph(2018)1 cited
- → Parity and disparity subgraphs(2008)
- → Non-adaptive Group Testing on Graphs(2018)
- Reconstuctibility of K-Distance-Local Subgraphs Rooted at a Subgraph(2002)