Efficient algorithms for a mixed \(k\)-partition problem of graphs without specifying bases
From MaRDI portal
Publication:1129014
DOI10.1016/S0304-3975(97)00225-9zbMath0902.68141MaRDI QIDQ1129014
Akinari Takaki, Koichi Wada, Kimio Kawaguchi
Publication date: 13 August 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Eulerian cycle; \(k\)-edge-connected graphs; \(k\)-partition of graph; minimal biconnected graphs; nonseparating ear decomposition
68R10: Graph theory (including graph drawing) in computer science
68W10: Parallel algorithms in computer science
Related Items
Efficient algorithms for a mixed k-partition problem of graphs without specifying bases, A note on the computational complexity of graph vertex partition
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A linear algorithm for bipartition of biconnected graphs
- Fault-tolerant routings in a \(\kappa\)-connected network
- Forests, frames, and games: Algorithms for matroid sums and applications
- A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
- On partitioning the edges of graphs into connected subgraphs
- Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
- A homology theory for spanning tress of a graph