Contracting graphs to paths and trees (Q2441588): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Divide-and-Conquer: Improved Path, Matching, and Packing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Parameterized Connected Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast FPT-Algorithms for Cleaning Grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infeasibility of instance compression and succinct PCPs for NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Increasing the Minimum Degree of a Graph by Contractions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contracting chordal graphs and bipartite graphs to paths and trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2911626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obtaining a planar graph by vertex deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems Parameterized by Treewidth Tractable in Single Exponential Time: A Logical Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proper interval vertex deletion / rank
 
Normal rank

Latest revision as of 12:00, 7 July 2024

scientific article; zbMATH DE number 6046496
  • Contracting Graphs to Paths and Trees
Language Label Description Also known as
English
Contracting graphs to paths and trees
scientific article; zbMATH DE number 6046496
  • Contracting Graphs to Paths and Trees

Statements

Contracting graphs to paths and trees (English)
0 references
Contracting Graphs to Paths and Trees (English)
0 references
0 references
0 references
0 references
0 references
0 references
25 March 2014
0 references
15 June 2012
0 references
graph modification problems
0 references
edge contractions
0 references
tree contraction
0 references
path contraction
0 references
FPT algorithms
0 references
kernelization
0 references
0 references
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
0 references
0 references
0 references
0 references
0 references