Efficient Algorithms for the Label Cut Problems

DOI10.1007/978-3-319-06089-7_18zbMath1406.05106OpenAlexW168251437MaRDI QIDQ5410648

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

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

Related Items (4)

The label cut problem with respect to path length and label frequency ⋮ New algorithms for the minimum coloring cut problem ⋮ Efficient heuristics for the minimum labeling global cut problem ⋮ Maximum cuts in edge-colored graphs

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