Algorithms for Multiterminal Cuts (Q3503649): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.1007/978-3-540-79709-8_32 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1519134344 / 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: An improved approximation algorithm of MULTIWAY CUT. / 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: 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: Finding small balanced separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiway cuts in node weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beyond the flow decomposition barrier / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Algorithm for the k-cut Problem for Fixed k / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rounding algorithms for a geometric embedding of minimum multiway cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized graph separation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2-Approximation Algorithm for the Directed Multiway Cut Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Algorithm for the Planar Multiway Cut Problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:24, 28 June 2024

scientific article
Language Label Description Also known as
English
Algorithms for Multiterminal Cuts
scientific article

    Statements

    Algorithms for Multiterminal Cuts (English)
    0 references
    0 references
    5 June 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Graph Algorithm
    0 references
    Multiterminal Cut
    0 references
    Multicut
    0 references
    Fixed Parameter Tractability
    0 references
    0 references