Pages that link to "Item:Q1764810"
From MaRDI portal
The following pages link to Computing the branchwidth of interval graphs (Q1764810):
Displaying 6 items.
- Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in \(O(n^{1+\epsilon})\) time (Q553343) (← links)
- Branchwidth of chordal graphs (Q967314) (← links)
- Computing branchwidth via efficient triangulations and blocks (Q967315) (← links)
- Mixed search number and linear-width of interval and split graphs (Q3057182) (← links)
- Mixed Search Number and Linear-Width of Interval and Split Graphs (Q3508577) (← links)
- Tangle bases: Revisited (Q6087071) (← links)
