On the complexity of problems on tree-structured graphs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 5917571 (Why is no real title available?)
- Classes of Pebble Games and Complete Problems
- Exploring the gap between treedepth and vertex cover through vertex integrity
- Fixed-Parameter Tractability and Completeness I: Basic Results
- Fixed-parameter tractability and completeness II: On completeness for W[1]
- Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues
- Fundamentals of parameterized complexity
- Generalized coloring for tree-like graphs
- On space efficiency of algorithms working on structural decompositions of graphs
- On the complexity of some colorful problems parameterized by treewidth
- On the parameterized complexity of computing tree-partitions
- On the space and circuit complexity of parameterized problems: classes and completeness
- Parameterized algorithms
- Parameterized problems complete for nondeterministic FPT time and logarithmic space
- Parametrized complexity theory.
- Properties that characterize LOGCFL
- The complexity of theorem-proving procedures
- The parameterized space complexity of model-checking bounded variable first-order logic
- Tree-size bounded alternation
- Width-parametrized SAT: time-space tradeoffs
- XNLP-completeness for parameterized problems on graphs with a linear structure
Cited in
(4)
This page was built for publication: On the complexity of problems on tree-structured graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6969006)
