Tree-decompositions of small pathwidth
From MaRDI portal
Publication:5899355
Cites work
- scientific article; zbMATH DE number 1303600 (Why is no real title available?)
- scientific article; zbMATH DE number 1361465 (Why is no real title available?)
- All structured programs have small tree width and good register allocation
- Complexity of Finding Embeddings in a k-Tree
- Memory requirements for table computations in partial \(k\)-tree algorithms
- Representation of a finite graph by a set of intervals on the real line
- Triangulating graphs without asteroidal triples
- Triangulating multitolerance graphs
This page was built for publication: Tree-decompositions of small pathwidth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5899355)