Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs
From MaRDI portal
Publication:5387822
DOI10.1007/978-3-540-77120-3_76zbMath1193.68196OpenAlexW1544821268MaRDI QIDQ5387822
Publication date: 27 May 2008
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77120-3_76
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Characterizing and Computing Minimal Cograph Completions ⋮ Characterizing and computing minimal cograph completions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On rigid circuit graphs
- Minimal triangulations of graphs: a survey
- Parameterized coloring problems on chordal 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
- Fixed-parameter tractability of graph modification problems for hereditary properties
- Parameterized complexity of vertex colouring
- The Use of Linear Graphs in Gauss Elimination
- A completely dynamic algorithm for split graphs
- Obtaining a Planar Graph by Vertex Deletion
- Chordal Deletion Is Fixed-Parameter Tractable
- Vertex Coloring of Comparability+ke and –ke Graphs
- Minimal Split Completions of Graphs
- 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
