Discrete Applied Mathematics
Characterizations and algorithmic applications of chordal graph embeddings
Proceedings of the 4th Twente workshop on Graphs and combinatorial optimization
Linear time algorithms for graph search and connectivity determination on complement graphs
Information Processing Letters
Fully dynamic algorithms for chordal graphs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A practical algorithm for making filled graphs minimal
Theoretical Computer Science
Measures on monotone properties of graphs
Discrete Applied Mathematics
Treewidth and Minimum Fill-in: Grouping the Minimal Separators
SIAM Journal on Computing
Minimal Elimination Ordering Inside a Given Chordal Graph
WG '97 Proceedings of the 23rd International Workshop on Graph-Theoretic Concepts in Computer Science
A fully dynamic algorithm for modular decomposition and recognition of cographs
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
An Optimal Parallel Co-Connectivity Algorithm
Theory of Computing Systems
Every monotone graph property is testable
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Computing Minimal Triangulations in Time O(n\alpha \log n) = o(n2.376)
SIAM Journal on Discrete Mathematics
A Linear-Time Algorithm for Finding a Maximal Planar Subgraph
SIAM Journal on Discrete Mathematics
NP-completeness results for edge modification problems
Discrete Applied Mathematics - Special issue: Traces of the Latin American conference on combinatorics, graphs and applications: a selection of papers from LACGA 2004, Santiago, Chile
On the interval completion of chordal graphs
Discrete Applied Mathematics
Discrete Applied Mathematics
Characterizing minimal interval completions towards better understanding of profile and pathwidth
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Minimal proper interval completions
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
A linear time algorithm for finding a maximal planar subgraph based on PC-trees
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Minimal interval completion through graph exploration
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Minimal split completions of graphs
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Fast minimal triangulation algorithm using minimum degree criterion
Theoretical Computer Science
Strongly chordal and chordal bipartite graphs are sandwich monotone
Journal of Combinatorial Optimization
Hi-index | 5.23 |
We study graph properties that admit an increasing, or equivalently decreasing, sequence of graphs on the same vertex set such that for any two consecutive graphs in the sequence their difference is a single edge. This is useful for characterizing and computing minimal completions and deletions of arbitrary graphs into having these properties. We prove that threshold graphs and chain graphs admit such sequences. Based on this characterization and other structural properties, we present linear-time algorithms both for computing minimal completions and deletions into threshold, chain, and bipartite graphs, and for extracting a minimal completion or deletion from a given completion or deletion. Minimum completions and deletions into these classes are NP-hard to compute.