The parameterized landscape of labeled graph contractions
From MaRDI portal
Cites work
- A survey of graph edit distance
- Automatic exploration of the natural variability of RNA non-canonical geometric patterns with a parameterized sampling technique
- Bin packing with fixed number of bins revisited
- Cluster editing on cographs and related classes
- Comparison of phylogenetic trees
- Contractibility and NP-completeness
- Contracting graphs to paths and trees
- Contractions of Planar Graphs in Polynomial Time
- Detecting fixed patterns in chordal graphs in polynomial time
- Easy problems for tree-decomposable graphs
- Edge contractions in subclasses of chordal graphs
- Finding maximum common contractions between phylogenetic networks
- scientific article; zbMATH DE number 1142315 (Why is no real title available?)
- Improved hardness of maximum common subgraph problems on labeled graphs of bounded treewidth and bounded degree
- Lossy kernels for graph contraction problems
- Obtaining a bipartite graph by contracting few edges
- On the complexity of finding iso- and other morphisms for partial \(k\)- trees
- On the complexity of various parameterizations of common induced subgraph isomorphism
- On the parameterized complexity of \([1,j]\)-domination problems
- On the parameterized complexity of grid contraction
- On the parameterized complexity of multiple-interval graph problems
- Parameterized algorithms
- Parameterized complexity of three edge contraction problems with degree constraints
- Parametrized complexity theory.
- Rapid ab initio prediction of RNA pseudoknots via graph tree decomposition
- The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases
- The computational complexity of graph contractions II: Two tough polynomially solvable cases
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The Treewidth and Pathwidth of Graph Unions
This page was built for publication: The parameterized landscape of labeled graph contractions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7312594)
