Planar feedback vertex set and face cover: combinatorial bounds and subexponential algorithms (Q547307): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68R10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5916753 / rank
 
Normal rank
Property / zbMATH Keywords
 
branchwidth
Property / zbMATH Keywords: branchwidth / rank
 
Normal rank
Property / zbMATH Keywords
 
parameterized algorithms
Property / zbMATH Keywords: parameterized algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
feedback vertex set
Property / zbMATH Keywords: feedback vertex set / rank
 
Normal rank
Property / zbMATH Keywords
 
face cover
Property / zbMATH Keywords: face cover / rank
 
Normal rank
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/s00453-010-9390-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2005515778 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4488089 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Cubic Kernel for Feedback Vertex Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Kernel for Planar Feedback Vertex Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Kernel for the k-Disjoint Cycle Problem on Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: (Meta) Kernelization / 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: A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential speedup of fixed-parameter algorithms for classes of graphs excluding single-crossing graphs as minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming and Fast Matrix Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579494 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponential parameterized algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up / rank
 
Normal rank
Property / cites work
 
Property / cites work: New upper bounds on the decomposability of planar graphs / 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: Primal-dual approximation algorithms for feedback problems in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal branch-decomposition of planar graphs in <i>O</i> ( <i>n</i> <sup>3</sup> ) Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Branch Decompositions I: The Ratcatcher / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Branch Decompositions II: The Cycle Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414505 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. X: Obstructions to tree-decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Call routing and the ratcatcher / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:41, 4 July 2024

scientific article
Language Label Description Also known as
English
Planar feedback vertex set and face cover: combinatorial bounds and subexponential algorithms
scientific article

    Statements

    Planar feedback vertex set and face cover: combinatorial bounds and subexponential algorithms (English)
    0 references
    0 references
    1 July 2011
    0 references
    0 references
    branchwidth
    0 references
    parameterized algorithms
    0 references
    feedback vertex set
    0 references
    face cover
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references