Minimum fill-in and treewidth of split + ke and split +kv graphs
From MaRDI portal
Publication:972334
DOI10.1016/J.DAM.2008.11.006zbMATH Open1216.05159OpenAlexW2050314192MaRDI QIDQ972334FDOQ972334
Authors: F. Mancini 
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
Recommendations
Cites Work
- Fixed-parameter tractability of graph modification problems for hereditary properties
- Title not available (Why is that?)
- Finding odd cycle transversals.
- Complexity of Finding Embeddings in a k-Tree
- Title not available (Why is that?)
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
- Title not available (Why is that?)
- Parameterized and Exact Computation
- Minimal triangulations of graphs: a survey
- The splittance of a graph
- On generating all maximal independent sets
- Parameterized complexity of vertex colouring
- Computing the Minimum Fill-In is NP-Complete
- Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs
- Complexity classification of some edge modification problems
- Parameterized coloring problems on chordal graphs
- The Use of Linear Graphs in Gauss Elimination
- Title not available (Why is that?)
- Counting clique trees and computing perfect elimination schemes in parallel
- Error compensation in leaf power problems
- Interval Completion Is Fixed Parameter Tractable
- Minimal triangulation of a graph and optimal pivoting order in a sparse matrix
- SOFSEM 2005: Theory and Practice of Computer Science
- Dynamically maintaining split graphs
- Obtaining a Planar Graph by Vertex Deletion
- Edge coloring nearly bipartite graphs
- Faster Parameterized Algorithms for Minimum Fill-In
- Improved Algorithms for the Feedback Vertex Set Problems
- Chordal Deletion Is Fixed-Parameter Tractable
- Title not available (Why is that?)
- On the interval completion of chordal graphs
- Vertex Coloring of Comparability+ke and –ke Graphs
- Graph-Theoretic Concepts in Computer Science
Cited In (5)
- On the effectiveness of the incremental approach to minimal chordal edge modification
- Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal Cliques
- Beyond classes of graphs with ``few minimal separators: FPT results through potential maximal cliques
- Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs
- Faster and enhanced inclusion-minimal cograph completion
This page was built for publication: Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q972334)
