Pages that link to "Item:Q1186787"
From MaRDI portal
The following pages link to Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families (Q1186787):
Displaying 4 items.
- Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees (Q2403697) (← links)
- Large Induced Subgraphs via Triangulations and CMSO (Q2954371) (← links)
- Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
- Parallel algorithms with optimal speedup for bounded treewidth (Q4645184) (← links)
