Efficient algorithms for a mixed k-partition problem of graphs without specifying bases
DOI10.1007/3-540-59071-4_58zbMATH Open1528.68328MaRDI QIDQ6184380FDOQ6184380
Authors: Koichi Wada, Akinari Takaki, Kimio Kawaguchi 
Publication date: 5 January 2024
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Recommendations
- Efficient algorithms for a mixed \(k\)-partition problem of graphs without specifying bases
- scientific article; zbMATH DE number 1262808
- Efficient algorithms for tripartitioning triconnected graphs and 3-edge-connected graphs
- scientific article; zbMATH DE number 409492
- An \(O(k^ 2 n^ 2)\) algorithm to find a \(k\)-partition in a \(k\)- connected graph
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Forests, frames, and games: Algorithms for matroid sums and applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- A homology theory for spanning tress of a graph
- A linear algorithm for bipartition of biconnected graphs
- Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
- On partitioning the edges of graphs into connected subgraphs
- A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
- Fault-tolerant routings in a \(\kappa\)-connected network
- Title not available (Why is that?)
- Efficient algorithms for a mixed \(k\)-partition problem of graphs without specifying bases
Cited In (1)
This page was built for publication: Efficient algorithms for a mixed k-partition problem of graphs without specifying bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6184380)
