Pages that link to "Item:Q329301"
From MaRDI portal
The following pages link to Largest chordal and interval subgraphs faster than \(2^n\) (Q329301):
Displaying 5 items.
- Vertex deletion problems on chordal graphs (Q1786595) (← links)
- Subexponential-time algorithms for finding large induced sparse subgraphs (Q2041989) (← links)
- Largest Chordal and Interval Subgraphs Faster Than 2 n (Q2849310) (← links)
- Four Shorts Stories on Surprising Algorithmic Uses of Treewidth (Q5042454) (← links)
- Proximity Search for Maximal Subgraph Enumeration (Q5048293) (← links)
