Efficient Algorithms for the Label Cut Problems

DOI10.1007/978-3-319-06089-7_18MaRDI QIDQ5410648zbMATH OpenOpenAlexFDO

Authors Peng Zhang

Publication date 16 April 2014

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-06089-7_18

Mathematics Subject Classification ID

Connectivity (05C40) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25)

Recommendations

• Approximation and Hardness Results for Label Cut and Related Problems
• Approximation and hardness results for label cut and related problems
• Efficient heuristics for the minimum labeling global cut problem
• Efficient Algorithms for the k Smallest Cuts Enumeration
• Approximation algorithms for feasible cut and multicut problems
• scientific article; zbMATH DE number 177540
• Efficient algorithms for the problems of enumerating cuts by non-decreasing weights
• Efficient algorithms for minimum range cut problems
• scientific article; zbMATH DE number 7364985
• Approximating minimum label s-t cut via linear programming

Cited in

(10)

• Simpler and better approximation algorithms for the unweighted minimum label \(s\)-\(t\) cut problem
• Efficient heuristics for the minimum labeling global cut problem
• Maximum reachability preserved graph cut
• Labeled cuts in graphs
• The label cut problem with respect to path length and label frequency
• Approximation and Hardness Results for Label Cut and Related Problems
• scientific article; zbMATH DE number 7364985 (Why is no real title available?)
• New algorithms for the minimum coloring cut problem
• Approximation and hardness results for label cut and related problems
• Solving the minimum labeling global cut problem by mathematical programming

This page was built for publication: Efficient Algorithms for the Label Cut Problems

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