Bisecting a 4-connected graph with three resource sets
DOI10.1016/J.DAM.2007.03.004zbMATH Open1142.05068OpenAlexW2154818280MaRDI QIDQ997070FDOQ997070
Authors: Toshimasa Ishii, Kengo Iwata, Hiroshi Nagamochi 
Publication date: 19 July 2007
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://barrel.repo.nii.ac.jp/?action=repository_action_common_download&item_id=49&item_no=1&attribute_id=19&file_no=1
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- A tabu search heuristic and adaptive memory procedure for political districting
- Title not available (Why is that?)
- Approximating the Maximally Balanced Connected Partition Problem in graphs
- On the complexity of partitioning graphs into connected subgraphs
- A linear algorithm for bipartition of biconnected graphs
- A recursive characterization of the 4-connected graphs
- Algorithms for ham-sandwich cuts
- A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
- Title not available (Why is that?)
- Convex embeddings and bisections of 3-connected graphs
Cited In (6)
- A deterministic annealing algorithm for approximating a solution of the min-bisection problem
- Convex embeddings and bisections of 3-connected graphs
- Title not available (Why is that?)
- A robust algorithm for bisecting a triconnected graph with two resource sets
- A deterministic annealing algorithm for the minimum concave cost network flow problem
- Algorithms and Computation
This page was built for publication: Bisecting a 4-connected graph with three resource sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q997070)
