Pages that link to "Item:Q4695381"
From MaRDI portal
The following pages link to The Pathwidth and Treewidth of Cographs (Q4695381):
Displaying 23 items.
- 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)
- A Characterisation of the Minimal Triangulations of Permutation Graphs (Q3508558) (← links)
- How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms (Q3508575) (← links)
- Inference and Learning in Multi-dimensional Bayesian Network Classifiers (Q3524958) (← links)
- Automata-based Representations for Infinite Graphs (Q4331049) (← links)
- How to use the minimal separators of a graph for its chordal triangulation (Q4645172) (← links)
- Treewidth and Pathwidth of Permutation Graphs (Q4863978) (← links)
- On perfect and quasiperfect dominations in graphs (Q5005483) (← links)
- As Time Goes By: Reflections on Treewidth for Temporal Graphs (Q5042450) (← links)
- Bounding the search number of graph products (Q5215862) (← 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)
- Tree decompositions and social graphs (Q5856440) (← links)
- Tree-decompositions of small pathwidth (Q5916128) (← links)
- Computing subset transversals in \(H\)-free graphs (Q5918462) (← links)
- On intervalizing \(k\)-colored graphs for DNA physical mapping (Q5961618) (← links)
- Principled deep neural network training through linear programming (Q6054389) (← links)
- Treewidth versus clique number. II: Tree-independence number (Q6144406) (← links)
- Tree-width and path-width of comparability graphs of interval orders (Q6184354) (← links)
- Graph searching on chordal graphs (Q6487435) (← links)
- Parameterized problems complete for nondeterministic FPT time and logarithmic space (Q6614886) (← links)