Q3304141 (Q3304141): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1710.07148 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph classes with structured neighborhoods and algorithmic applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3003675 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON DISJOINT CYCLES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedback vertex set on graphs of low clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pairwise Compatibility Graphs: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for feedback vertex set problems / 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: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Tractability and Completeness I: Basic Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4448752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intractability of Clique-Width Parameterizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-width of path powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton Paths in Grid Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111880 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized and Exact Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / 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: Towards a characterization of leaf powers by clique arrangements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4425958 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster fixed parameter tractable algorithms for finding feedback vertex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of computing width parameters based on branch decompositions over the vertex set / rank
 
Normal rank
Property / cites work
 
Property / cites work: On polygon numbers of circle graphs and distance hereditary graphs / rank
 
Normal rank

Latest revision as of 05:24, 23 July 2024

scientific article
Language Label Description Also known as
English
No label defined
scientific article

    Statements

    0 references
    0 references
    0 references
    5 August 2020
    0 references
    graph width parameters
    0 references
    graph classes
    0 references
    feedback vertex set
    0 references
    leaf powers
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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