The label cut problem with respect to path length and label frequency

DOI10.1016/j.tcs.2016.08.006zbMath1350.68159MaRDI QIDQ313969

Peng Zhang, Bin Fu

Publication date: 12 September 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.08.006

zbMATH Keywords

computational complexity; approximation algorithm; parameterized algorithm; global label cut; label \(s\)-\(t\) cut

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C78: Graph labelling (graceful graphs, bandwidth, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

05C40: Connectivity