Pages that link to "Item:Q2867684"
From MaRDI portal
The following pages link to Using ILP/SAT to Determine Pathwidth, Visibility Representations, and other Grid-Based Graph Drawings (Q2867684):
Displaying 4 items.
- Finding small-width connected path decompositions in polynomial time (Q2328867) (← links)
- Art gallery problem with rook and queen vision (Q2657110) (← links)
- Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth (Q5266611) (← links)
- Linear ordering based MIP formulations for the vertex separation or pathwidth problem (Q5915912) (← links)
