Efficient algorithms for a mixed k-partition problem of graphs without specifying bases

DOI10.1016/S0304-3975(97)00225-9zbMATH Open0902.68141MaRDI QIDQ1129014FDOQ1129014

Authors: Koichi Wada, Akinari Takaki, Kimio Kawaguchi 

Publication date: 13 August 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 1262808
• An \(O(k^ 2 n^ 2)\) algorithm to find a \(k\)-partition in a \(k\)- connected graph
• scientific article; zbMATH DE number 409492

zbMATH Keywords

\(k\)-edge-connected graphs\(k\)-partition of graphEulerian cycleminimal biconnected graphsnonseparating ear decomposition

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

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?)

Cited In (4)

• Title not available (Why is that?)
• Efficient algorithms for a mixed k-partition problem of graphs without specifying bases
• Efficient algorithms for tripartitioning triconnected graphs and 3-edge-connected graphs
• A note on the computational complexity of graph vertex partition

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 Q1129014)