Pages that link to "Item:Q1402225"
From MaRDI portal
The following pages link to Computing the treewidth and the minimum fill-in with the modular decomposition (Q1402225):
Displaying 12 items.
- Acyclic and star colorings of cographs (Q643025) (← links)
- On algorithms for (\(P_5\), gem)-free graphs (Q817767) (← links)
- Solving some NP-complete problems using split decomposition (Q948695) (← links)
- Algorithms parameterized by vertex cover and modular width, through potential maximal cliques (Q1751087) (← links)
- Minimal separators in extended \(P_4\)-laden graphs (Q1759855) (← links)
- Counting spanning trees using modular decomposition (Q2437761) (← links)
- Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem (Q2656894) (← links)
- Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization (Q3012824) (← links)
- Counting Spanning Trees in Graphs Using Modular Decomposition (Q3078398) (← links)
- A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs (Q3387760) (← links)
- (Q5150424) (← links)
- (Q5150500) (← links)
