Strongly chordal and chordal bipartite graphs are sandwich monotone

Authors:
Pinar Heggernes;Federico Mancini;Charis Papadopoulos;R. Sritharan
Affiliations:
Department of Informatics, University of Bergen, Bergen, Norway 5020;Department of Informatics, University of Bergen, Bergen, Norway 5020;Department of Mathematics, University of Ioannina, Ioannina, Greece 45110;Department of Computer Science, University of Dayton, Dayton, USA 45469
Venue:
Journal of Combinatorial Optimization
Year:
2011

Citing 15
Cited 1

Three partition refinement algorithms

SIAM Journal on Computing
Doubly lexical ordering of dense 0–1 matrices

Information Processing Letters
Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs

SIAM Journal on Computing
Measures on monotone properties of graphs

Discrete Applied Mathematics
Treewidth and Minimum Fill-in: Grouping the Minimal Separators

SIAM Journal on Computing
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Every monotone graph property is testable

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
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 complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs

Theoretical Computer Science
Exact Algorithms for Treewidth and Minimum Fill-In

SIAM Journal on Computing
Characterizing and Computing Minimal Cograph Completions

FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints

COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions

Theoretical Computer Science
Minimal split completions

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

Efficient enumeration of the directed binary perfect phylogenies from incomplete data

SEA'12 Proceedings of the 11th international conference on Experimental Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

A graph class is sandwich monotone if, for every pair of its graphs G 1=(V,E 1) and G 2=(V,E 2) with E 1驴E 2, there is an ordering e 1,驴,e k of the edges in E 2驴E 1 such that G=(V,E 1驴{e 1,驴,e i }) belongs to the class for every i between 1 and k. In this paper we show that strongly chordal graphs and chordal bipartite graphs are sandwich monotone, answering an open question by Bakonyi and Bono (Czechoslov. Math. J. 46:577---583, 1997). So far, very few classes have been proved to be sandwich monotone, and the most famous of these are chordal graphs. Sandwich monotonicity of a graph class implies that minimal completions of arbitrary graphs into that class can be recognized and computed in polynomial time. For minimal completions into strongly chordal or chordal bipartite graphs no polynomial-time algorithm has been known. With our results such algorithms follow for both classes. In addition, from our results it follows that all strongly chordal graphs and all chordal bipartite graphs with edge constraints can be listed efficiently.