The following pages link to (Q4250226):
Displayed 6 items.
- Derivation of algorithms for cutwidth and related graph layout parameters (Q1015810) (← links)
- All structured programs have small tree width and good register allocation (Q1271620) (← links)
- Listing all potential maximal cliques of a graph (Q1605302) (← links)
- Tree-decompositions of small pathwidth (Q5899355) (← links)
- Tree-decompositions of small pathwidth (Q5916128) (← links)
- Circular-arc graph coloring: On chords and circuits in the meeting graph (Q5953338) (← links)