scientific article; zbMATH DE number 1522947

MaRDI QIDQ4511243zbMATH OpenFDO

Authors Hiroshi Nagamochi, Yoshitaka Nakao, Toshihide Ibaraki, Tibor Jordán

Publication date 28 November 2001

zbMATH Keywords

3-connected graphbisectionconvex embeddinggraph-partitioningham-sandwich cut

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Computational aspects related to convexity (52B55) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Convex embeddings and bisections of 3-connected graphs
• 2-bisections in claw-free cubic multigraphs
• Bisecting a 4-connected graph with three resource sets
• Algorithms and Computation
• A robust algorithm for bisecting a triconnected graph with two resource sets

Cited in

(6)

• Convex embeddings and bisections of 3-connected graphs
• A robust algorithm for bisecting a triconnected graph with two resource sets
• scientific article; zbMATH DE number 4093513 (Why is no real title available?)
• Convex Partitions with 2-Edge Connected Dual Graphs
• Algorithms and Computation
• Bisecting a 4-connected graph with three resource sets

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4511243)