Paths to Trees and Cacti (Q5283353): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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/978-3-319-57586-5_4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2606694986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-contraction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Subexponential Parameterized Algorithm for Proper Interval Completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Subexponential Parameterized Algorithm for Proper Interval Completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability of graph modification problems for hereditary properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contracting Few Edges to Remove Forbidden Induced Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit interval editing is fixed-parameter tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Recognition of Almost Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chordal Editing is Fixed-Parameter Tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval Deletion Is Fixed-Parameter Tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial kernel for trivially perfect editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the threshold of intractability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2965491 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for parameterized complexity of cluster editing with a small number of clusters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponential Parameterized Algorithm for Minimum Fill-In / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster parameterized algorithms for deletion to split graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obtaining planarity by contracting few edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster FPT algorithm for bipartite contraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contracting graphs to paths and trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity of Vertex Deletion into Perfect Graph Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obtaining a Bipartite Graph by Contracting Few Edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsification Upper and Lower Bounds for Graphs Problems and Not-All-Equal SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chordal deletion is fixed-parameter tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding odd cycle transversals. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the removal of forbidden graphs by edge-deletion or by edge- contraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the NP-hardness of edge-deletion and -contraction problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:41, 14 July 2024

scientific article; zbMATH DE number 6751049
Language Label Description Also known as
English
Paths to Trees and Cacti
scientific article; zbMATH DE number 6751049

    Statements

    Paths to Trees and Cacti (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 July 2017
    0 references
    0 references
    0 references

    Identifiers