Graph modification problem for some classes of graphs
Author:
- R. SritharanRSR. Sritharan
- 1 May 2016
- journal article
- Published by Elsevier in Journal of Discrete Algorithms
- Vol. 38-41, 32-37
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Strongly chordal and chordal bipartite graphs are sandwich monotoneJournal of Combinatorial Optimization, 2010
- Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletionsTheoretical Computer Science, 2009
- Chordal bipartite completion of colored graphsDiscrete Mathematics, 2008
- On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphsTheoretical Computer Science, 2007
- NP-completeness results for edge modification problemsDiscrete Applied Mathematics, 2006
- Complexity classification of some edge modification problemsDiscrete Applied Mathematics, 2001
- Graph Classes: A Survey1999
- Classes of bipartite graphs related to chordal graphsDiscrete Applied Mathematics, 1991
- Characterizations of strongly chordal graphsDiscrete Mathematics, 1983
- Computing the Minimum Fill-In is NP-CompleteSIAM Journal on Algebraic Discrete Methods, 1981