Treewidth and pathwidth parameterized by the vertex cover number (Q344839): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1305.0433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fourier meets M\"{o}bius: fast subset convolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4699283 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On exact algorithms for treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on exact algorithms for vertex ordering problems on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernel Bounds for Structural Parameterizations of Pathwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth and Pathwidth Parameterized by the Vertex Cover Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved upper bounds for vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cutwidth parameterized by vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Layout Problems Parameterized by Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact exponential algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms parameterized by vertex cover and modular width, through potential maximal cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Induced Subgraphs via Minimal Triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Parameterized Algorithm for Chordal Sandwich / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Approach to Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sparsification for computing treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vertex separation number of a graph equals its path-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Directed Pathwidth in O(1.89 n ) Time / rank
 
Normal rank

Latest revision as of 23:33, 12 July 2024

scientific article
Language Label Description Also known as
English
Treewidth and pathwidth parameterized by the vertex cover number
scientific article

    Statements

    Treewidth and pathwidth parameterized by the vertex cover number (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    24 November 2016
    0 references
    treewidth
    0 references
    pathwidth
    0 references
    vertex cover
    0 references
    parameterized algorithms
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references