Computing the Map of Geometric Minimal Cuts

DOI10.1007/978-3-642-10631-6_26MaRDI QIDQ3652210zbMATH OpenOpenAlexFDO

Authors Jinhui Xu, Evanthia Papadopoulou, Lei Xu

Publication date 17 December 2009

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-10631-6_26

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Computational aspects related to convexity (52B55)

Recommendations

• Computing the map of geometric minimal cuts
• Map of geometric minimal cuts for general planar embedding
• Minimum cuts in geometric intersection graphs
• Computing minimum cuts in hypergraphs
• On the Minimum Cut of Planarizations
• Combinatorial and geometric properties of the max-cut and min-cut problems
• Computing minimum multiway cuts in hypergraphs
• Structural and algorithmic properties for parametric minimum cuts
• scientific article; zbMATH DE number 3891429

Cited in

(2)

• Computing the map of geometric minimal cuts
• Map of geometric minimal cuts for general planar embedding

This page was built for publication: Computing the Map of Geometric Minimal Cuts

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