Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms (Q5302061): 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-540-92248-3_24 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1584291908 / 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: The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Algorithms for the 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: Subexponential parameterized algorithms on bounded-genus graphs and <i>H</i> -minor-free 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: 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: Parametrized complexity theory. / 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: 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: Primal-dual approximation algorithms for feedback problems in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / 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

Latest revision as of 00:22, 29 June 2024

scientific article; zbMATH DE number 5494802
Language Label Description Also known as
English
Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms
scientific article; zbMATH DE number 5494802

    Statements

    Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms (English)
    0 references
    20 January 2009
    0 references
    0 references
    0 references