Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs
From MaRDI portal
Publication:972334
DOI10.1016/j.dam.2008.11.006zbMath1216.05159MaRDI QIDQ972334
Publication date: 25 May 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2008.11.006
05C85: Graph algorithms (graph-theoretic aspects)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding odd cycle transversals.
- Minimal triangulations of graphs: a survey
- Parameterized coloring problems on chordal graphs
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
- Dynamically maintaining split graphs
- On generating all maximal independent sets
- The splittance of a graph
- Minimal triangulation of a graph and optimal pivoting order in a sparse matrix
- Counting clique trees and computing perfect elimination schemes in parallel
- Edge coloring nearly bipartite graphs
- Fixed-parameter tractability of graph modification problems for hereditary properties
- Parameterized complexity of vertex colouring
- On the interval completion of chordal graphs
- Error compensation in leaf power problems
- The Use of Linear Graphs in Gauss Elimination
- Obtaining a Planar Graph by Vertex Deletion
- Chordal Deletion Is Fixed-Parameter Tractable
- Vertex Coloring of Comparability+ke and –ke Graphs
- Faster Parameterized Algorithms for Minimum Fill-In
- Improved Algorithms for the Feedback Vertex Set Problems
- Interval Completion Is Fixed Parameter Tractable
- Complexity of Finding Embeddings in a k-Tree
- Computing the Minimum Fill-In is NP-Complete
- Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs
- Parameterized and Exact Computation
- SOFSEM 2005: Theory and Practice of Computer Science
- Graph-Theoretic Concepts in Computer Science
- Complexity classification of some edge modification problems
