Perfect forests in graphs and their extensions
From MaRDI portal
Recommendations
Cites work
- 2-player Nash and nonsymmetric bargaining games: algorithms and structural properties
- \textsc{Max-Cut} parameterized above the Edwards-Erdős bound
- Balanced Judicious Bipartition is Fixed-Parameter Tractable
- Component order connectivity in directed graphs
- Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey
- Faster parameterized algorithms using linear programming
- Fundamentals of parameterized complexity
- scientific article; zbMATH DE number 1330033 (Why is no real title available?)
- scientific article; zbMATH DE number 7724227 (Why is no real title available?)
- Introduction to algorithms.
- Matching theory
- Note on Perfect Forests
- Note on Perfect Forests in Digraphs
- On induced subgraphs with all degree odd
- On the complexity of testing for odd holes and induced odd paths
- Parameterized algorithms
- Parametrized complexity theory.
- The complexity of satisfiability problems
- Two short proofs of the Perfect Forest Theorem
Cited in
(7)
This page was built for publication: Perfect forests in graphs and their extensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6057643)