Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs (Q2462149): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2007.02.014 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2153724959 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge disjoint paths and max integral multiflow/min multicut theorems in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4699283 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth: Characterizations, Applications, and Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal multicut and maximal integer multiflow: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Multiterminal Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5624995 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolutionary trees: An integer multicommodity max-flow -- min-cut theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual approximation algorithms for integral flow and multicut in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiway cuts in node weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability and data reduction for multicut in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms and applications for tree-like Weighted Set Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Commodity Flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth. Computations and approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized graph separation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics in Intersection Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4407447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical algorithms on partial k-trees with an application to domination-like problems / rank
 
Normal rank

Latest revision as of 12:26, 27 June 2024

scientific article
Language Label Description Also known as
English
Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
scientific article

    Statements

    Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    23 November 2007
    0 references
    NP-completeness
    0 references
    parameterized complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers