An optimal algorithm for the minimum edge cardinality cut surface problem

DOI10.1145/777792.777843MaRDI QIDQ5361640zbMATH OpenOpenAlexFDO

Authors David E. Cardoze

Publication date 29 September 2017

Published in Proceedings of the nineteenth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/777792.777843

zbMATH Keywords

computational topologycomputer graphicsmanifold conversionscientific visualization

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• A fixed parameter tractable approximation scheme for the optimal cut graph of a surface
• Minimum Cuts in Surface Graphs
• Solving minimum K-cardinality cut problems in planar graphs
• An \NC Algorithm for Minimum Cuts
• A new approach to the minimum cut problem
• Cardinality constrained minimum cut problems: complexity and algorithms.
• An efficient algorithm for the minimum capacity cut problem
• Approximation algorithms for minimum \(K\)-cut
• Structural and algorithmic properties for parametric minimum cuts
• scientific article; zbMATH DE number 6469225

Cited in

(2)

• scientific article; zbMATH DE number 2086692 (Why is no real title available?)
• Optimal Deterministic Algorithms for 2-d and 3-d Shallow Cuttings

This page was built for publication: An optimal algorithm for the minimum edge cardinality cut surface problem

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