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

DOI10.1007/3-540-59071-4_58zbMath1528.68328MaRDI QIDQ6184380

Kimio Kawaguchi, Koichi Wada, Akinari Takaki

Publication date: 5 January 2024

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

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
• Efficient algorithms for a mixed \(k\)-partition problem of graphs without specifying bases
• 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

This page was built for publication: Efficient algorithms for a mixed k-partition problem of graphs without specifying bases