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

Given a graph with labels defined on edges and a source-sink pair (s,t), the Labels-tCut problem asks for a minimum number of labels such that the removal of edges with these labels disconnects s and t. Similarly, the Global Label Cut problem asks for a minimum number of labels to disconnect G itsel...

Full description

Saved in:

Bibliographic Details
Published in:	Theoretical computer science Vol. 648; pp. 72 - 83
Main Authors:	Zhang, Peng, Fu, Bin
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 04.10.2016
Subjects:	Algorithms Approximation algorithm Computational complexity Constants Disengaging Global Label Cut Graph theory Graphs Label [formula omitted] Cut Labels Parameterized algorithm Parameters Polynomials Label s-t Cut Global Label Cut Parameterized algorithm Approximation algorithm Computational complexity
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!