The following pages link to Pathwidth of Circular-Arc Graphs (Q3508573):
Displayed 11 items.
- Computing directed pathwidth in \(O(1.89^n)\) time (Q300464) (← links)
- Edge search number of cographs (Q415273) (← links)
- Exclusive graph searching (Q521823) (← links)
- A constant factor approximation algorithm for boxicity of circular arc graphs (Q741528) (← links)
- Approximate search strategies for weighted trees (Q1929222) (← links)
- How to compute digraph width measures on directed co-graphs (Q2220888) (← links)
- Linear rank-width and linear clique-width of trees (Q2346380) (← links)
- Mixed Search Number of Permutation Graphs (Q3507333) (← links)
- Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth (Q5266611) (← links)
- Edge Search Number of Cographs in Linear Time (Q5321690) (← links)
- Pathwidth is NP-Hard for Weighted Trees (Q5321709) (← links)