Pages that link to "Item:Q4863978"
From MaRDI portal
The following pages link to Treewidth and Pathwidth of Permutation Graphs (Q4863978):
Displaying 50 items.
- Vertex ranking of asteroidal triple-free graphs (Q293448) (← links)
- Computing directed pathwidth in \(O(1.89^n)\) time (Q300464) (← links)
- Combining intensification and diversification strategies in VNS. An application to the vertex separation problem (Q337212) (← links)
- Variable neighborhood search for the vertex separation problem (Q339678) (← links)
- Two characterisations of the minimal triangulations of permutation graphs (Q390311) (← links)
- Edge search number of cographs (Q415273) (← links)
- Restricted vertex multicut on permutation graphs (Q444445) (← links)
- A polynomial-time algorithm for computing \(K\)-terminal residual reliability of \(d\)-trapezoid graphs (Q477692) (← links)
- Treewidth computations. II. Lower bounds (Q549673) (← links)
- Treewidth and minimum fill-in on permutation graphs in linear time (Q708222) (← links)
- A linear time algorithm to list the minimal separators of chordal graphs (Q819826) (← links)
- The firefighter problem on graph classes (Q899308) (← links)
- On probe permutation graphs (Q967305) (← links)
- Computing branchwidth via efficient triangulations and blocks (Q967315) (← links)
- On a property of minimal triangulations (Q1024493) (← links)
- Treewidth of cocomparability graphs and a new order-theoretic parameter (Q1337573) (← links)
- Measuring the vulnerability for classes of intersection graphs (Q1364473) (← links)
- Treewidth for graphs with small chordality (Q1372729) (← links)
- Characterizations and algorithmic applications of chordal graph embeddings (Q1372739) (← links)
- Recognizing interval digraphs and interval bigraphs in polynomial time (Q1377666) (← links)
- On treewidth and minimum fill-in of asteroidal triple-free graphs (Q1392207) (← links)
- Approximating the treewidth of AT-free graphs. (Q1408810) (← links)
- Chordal embeddings of planar graphs (Q1417569) (← links)
- Edge and node searching problems on trees (Q1575444) (← links)
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors (Q1880778) (← links)
- Approximate search strategies for weighted trees (Q1929222) (← links)
- On the vertex ranking problem for trapezoid, circular-arc and other graphs (Q1961233) (← links)
- A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs (Q1962057) (← links)
- Locally definable vertex set properties are efficiently enumerable (Q1983133) (← links)
- How to compute digraph width measures on directed co-graphs (Q2220888) (← links)
- On the maximum weight minimal separator (Q2333804) (← links)
- Linear rank-width and linear clique-width of trees (Q2346380) (← links)
- Computing \(K\)-terminal reliability of \(d\)-trapezoid graphs (Q2445238) (← links)
- Node-searching problem on block graphs (Q2462351) (← links)
- The first order definability of graphs with separators via the Ehrenfeucht game (Q2570131) (← links)
- Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem (Q2656894) (← links)
- Finding a maximum minimal separator: graph classes and fixed-parameter tractability (Q2661784) (← links)
- Large Induced Subgraphs via Triangulations and CMSO (Q2954371) (← links)
- On the Maximum Weight Minimal Separator (Q2988830) (← links)
- On Distance-d Independent Set and Other Problems in Graphs with “few” Minimal Separators (Q3181057) (← links)
- Mixed Search Number of Permutation Graphs (Q3507333) (← links)
- A Characterisation of the Minimal Triangulations of Permutation Graphs (Q3508558) (← links)
- Constructive linear time algorithms for branchwidth (Q4571992) (← links)
- How to use the minimal separators of a graph for its chordal triangulation (Q4645172) (← links)
- As Time Goes By: Reflections on Treewidth for Temporal Graphs (Q5042450) (← links)
- GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH (Q5249047) (← 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)
- On finding separators in temporal split and permutation graphs (Q5918685) (← links)
