Pages that link to "Item:Q1309811"
From MaRDI portal
The following pages link to On the pathwidth of chordal graphs (Q1309811):
Displaying 40 items.
- Computing directed pathwidth in \(O(1.89^n)\) time (Q300464) (← links)
- Variable neighborhood search for the vertex separation problem (Q339678) (← links)
- Edge search number of cographs (Q415273) (← links)
- The complexity of minimum-length path decompositions (Q494076) (← links)
- Exclusive graph searching vs. pathwidth (Q729824) (← links)
- The complexity of zero-visibility cops and robber (Q897941) (← links)
- Connected graph searching in chordal graphs (Q967304) (← links)
- Minimal interval completion through graph exploration (Q1001896) (← links)
- Treewidth of cocomparability graphs and a new order-theoretic parameter (Q1337573) (← links)
- Treewidth for graphs with small chordality (Q1372729) (← links)
- Edge and node searching problems on trees (Q1575444) (← links)
- Vertex deletion problems on chordal graphs (Q1786595) (← links)
- Triangulating graphs without asteroidal triples (Q1917255) (← links)
- Approximate search strategies for weighted trees (Q1929222) (← links)
- On tradeoffs between width- and fill-like graph parameters (Q1999998) (← links)
- Well-partitioned chordal graphs (Q2144581) (← links)
- Homotopy height, grid-major height and graph-drawing height (Q2206879) (← links)
- How to compute digraph width measures on directed co-graphs (Q2220888) (← links)
- Pursuing a fast robber on a graph (Q2268876) (← links)
- On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs (Q2268880) (← links)
- Non-deterministic graph searching in trees (Q2344776) (← links)
- Three-fast-searchable graphs (Q2446838) (← links)
- Node-searching problem on block graphs (Q2462351) (← links)
- On the interval completion of chordal graphs (Q2492201) (← links)
- Mixed search number and linear-width of interval and split graphs (Q3057182) (← links)
- Mixed Search Number of Permutation Graphs (Q3507333) (← links)
- Mixed Search Number and Linear-Width of Interval and Split Graphs (Q3508577) (← links)
- Complexity of approximating the oriented diameter of chordal graphs (Q4459604) (← links)
- Treewidth and pathwidth of permutation graphs (Q4630253) (← links)
- Decision Diagram Decomposition for Quadratically Constrained Binary Optimization (Q4995079) (← links)
- Vertex Deletion Problems on Chordal Graphs (Q5136314) (← 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)
- Characterizations and directed path-width of sequence digraphs (Q6038712) (← links)
- On the monophonic rank of a graph (Q6045452) (← links)
- Dominoes (Q6184362) (← links)
- Graph searching on chordal graphs (Q6487435) (← links)
- Corrigendum to: ``On the monophonic rank of a graph'' (Q6599811) (← links)
- Multicore graphs: characterization and properties (Q6616809) (← links)
