Pages that link to "Item:Q4695381"
From MaRDI portal
The following pages link to The Pathwidth and Treewidth of Cographs (Q4695381):
Displayed 50 items.
- Parameterized complexity dichotomy for \textsc{Steiner Multicut} (Q295637) (← links)
- Computing directed pathwidth in \(O(1.89^n)\) time (Q300464) (← links)
- Two characterisations of the minimal triangulations of permutation graphs (Q390311) (← links)
- Weighted maximum-clique transversal sets of graphs (Q410660) (← links)
- Edge search number of cographs (Q415273) (← links)
- The complexity of minimum-length path decompositions (Q494076) (← links)
- \(k\)-chordal graphs: from cops and robber to compact routing via treewidth (Q494802) (← links)
- Neighbourhood-width of trees (Q501055) (← links)
- Comparing the metric and strong dimensions of graphs (Q507581) (← links)
- Acyclic and star colorings of cographs (Q643025) (← links)
- The complexity of subgraph isomorphism for classes of partial k-trees (Q671437) (← links)
- Treewidth and minimum fill-in on permutation graphs in linear time (Q708222) (← links)
- Exclusive graph searching vs. pathwidth (Q729824) (← links)
- A vertex incremental approach for maintaining chordality (Q819824) (← links)
- Two characterisations of minimal triangulations of \(2K_{2}\)-free graphs (Q856888) (← links)
- Treewidth computations. I: Upper bounds (Q964001) (← links)
- Dynamic programming and planarity: improved tree-decomposition based algorithms (Q972340) (← links)
- Approximating the maximum clique minor and some subgraph homeomorphism problems (Q1022596) (← links)
- An optimal parallel algorithm for node ranking of cographs (Q1270781) (← links)
- A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
- Triangulating graphs with few \(P_4\)'s (Q1281383) (← links)
- Partial and perfect path covers of cographs (Q1281391) (← links)
- Treewidth of cocomparability graphs and a new order-theoretic parameter (Q1337573) (← links)
- Treewidth for graphs with small chordality (Q1372729) (← links)
- Characterizations and algorithmic applications of chordal graph embeddings (Q1372739) (← links)
- On interval routing schemes and treewidth (Q1383155) (← links)
- Fugitive-search games on graphs and related parameters (Q1392025) (← links)
- Triangulating multitolerance graphs (Q1392575) (← links)
- Edge and node searching problems on trees (Q1575444) (← links)
- The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs (Q1575712) (← links)
- Tree decompositions with small cost (Q1764801) (← links)
- Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width (Q1764808) (← links)
- Contraction and deletion blockers for perfect graphs and \(H\)-free graphs (Q1784743) (← links)
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors (Q1880778) (← links)
- Triangulating graphs without asteroidal triples (Q1917255) (← links)
- On characterizations for subclasses of directed co-graphs (Q2025109) (← links)
- From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats (Q2172401) (← links)
- How to compute digraph width measures on directed co-graphs (Q2220888) (← links)
- On the spectrum and number of convex sets in graphs (Q2339431) (← links)
- A revisit of the scheme for computing treewidth and minimum fill-in (Q2441783) (← links)
- Node-searching problem on block graphs (Q2462351) (← links)
- Linear layouts measuring neighbourhoods in graphs (Q2502893) (← links)
- Efficient parallel recognition of cographs (Q2565857) (← links)
- Finding a maximum minimal separator: graph classes and fixed-parameter tractability (Q2661784) (← links)
- FPT is characterized by useful obstruction sets (Q2828222) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- Contraction Blockers for Graphs with Forbidden Induced Paths (Q2947020) (← links)
- Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization (Q3012824) (← links)
- Linear-time algorithm for the matched-domination problem in cographs (Q3101607) (← links)
- A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs (Q3387760) (← links)