A simple algorithm for multicuts in planar graphs with outer terminals (Q1026166): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2008.11.010 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2036743540 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2008.11.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2036743540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for NP-complete problems on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the multicut problem in bounded tree-width graphs and digraphs / 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: Efficient algorithms for \(k\)-terminal cuts on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Multiterminal Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Flow Through a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-disjoint paths in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiway cuts in node weighted graphs / 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: Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The planar multiterminal cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Theory and algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity flows in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Connected Augmentation Problems in Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. VI. Disjoint paths across a disc / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds for the max-flow min-multicut ratio for planar and \(K_{r,r}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3341921 / rank
 
Normal rank

Latest revision as of 17:35, 1 July 2024

scientific article
Language Label Description Also known as
English
A simple algorithm for multicuts in planar graphs with outer terminals
scientific article

    Statements

    A simple algorithm for multicuts in planar graphs with outer terminals (English)
    0 references
    0 references
    24 June 2009
    0 references
    0 references
    multicuts
    0 references
    planar graphs
    0 references
    graph algorithms
    0 references
    0 references