Efficient algorithms for a mixed k-partition problem of graphs without specifying bases
From MaRDI portal
Publication:6184380
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)
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
Cites work
- scientific article; zbMATH DE number 3652373 (Why is no real title available?)
- scientific article; zbMATH DE number 3688740 (Why is no real title available?)
- scientific article; zbMATH DE number 3603293 (Why is no real title available?)
- scientific article; zbMATH DE number 742959 (Why is no real title available?)
- A homology theory for spanning tress of a graph
- A linear algorithm for bipartition of biconnected graphs
- A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
- Efficient algorithms for a mixed \(k\)-partition problem of graphs without specifying bases
- Fault-tolerant routings in a \(\kappa\)-connected network
- Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
- Forests, frames, and games: Algorithms for matroid sums and applications
- On partitioning the edges of graphs into connected subgraphs
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)
