Faster exact algorithms for some terminal set problems (Q2361353): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Exact exponential algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Algorithms for Maximum Independent Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Induced Subgraphs via Minimal Triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: König Deletion Sets and Vertex Covers above the Matching Size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for maximum independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum $r$-Regular Induced Subgraph Problem: Fast Exponential Algorithms and Combinatorial Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Maximum Induced Degenerate Subgraph Faster Than 2 n / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über die Maximalzahl kreuzungsfreier H-Wege / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved parameterized algorithm for the minimum node multiway cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Multiway Cut Parameterized above Lower Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiway cuts in node weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized graph separation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating minimal subset feedback vertex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Computation of Maximum Induced Forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimum feedback vertex set problem: Exact and enumeration algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subset feedback vertex sets in chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved upper bounds for vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster deterministic \textsc{Feedback Vertex Set} / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of generalized clique covering / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum k-colorable subgraph problem for chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedback vertex set on AT-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Multicut Faster Than 2 n / rank
 
Normal rank

Latest revision as of 02:06, 14 July 2024

scientific article
Language Label Description Also known as
English
Faster exact algorithms for some terminal set problems
scientific article

    Statements

    Faster exact algorithms for some terminal set problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    30 June 2017
    0 references
    0 references
    exact exponential time algorithms
    0 references
    terminal set problems
    0 references
    multiway cut
    0 references
    feedback vertex set
    0 references
    0 references