On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs

Authors:
C. M. H. de Figueiredo;L. Faria;S. Klein;R. Sritharan
Affiliations:
COPPE, Universidade Federal do Rio de Janeiro, Caixa Postal 68511, 21941-972 Rio de Janeiro, RJ, Brazil;Departamento de Matemática, Faculdade de Formação de Professores, UERJ, Brazil;IM and COPPE, Universidade Federal do Rio de Janeiro, Caixa Postal 68530, 21945-970 Rio de Janeiro, RJ, Brazil;Computer Science Department, The University of Dayton, Dayton, OH 45469, USA
Venue:
Theoretical Computer Science
Year:
2007

Citing 12
Cited 6

Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs

SIAM Journal on Computing
Doubly lexical orderings of matrices

SIAM Journal on Computing
On the complexity of recognizing perfectly orderable graphs

Discrete Mathematics
Classes of bipartite graphs related to chordal graphs

Discrete Applied Mathematics
Which claw-free graphs are perfectly orderable?

Discrete Applied Mathematics
Graph sandwich problems

Journal of Algorithms
Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques

SIAM Journal on Computing
The homogeneous set sandwich problem

Information Processing Letters
The graph sandwich problem for 1-join composition is NP-complete

Discrete Applied Mathematics
Two Strikes Against Perfect Phylogeny

ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
On decision and optimization (k, l)-graph sandwich problems

Discrete Applied Mathematics

Probe Matrix Problems: Totally Balanced Matrices

AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone

COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Strongly chordal and chordal bipartite graphs are sandwich monotone

Journal of Combinatorial Optimization
A parameterized algorithm for chordal sandwich

CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
The P versus NP-complete dichotomy of some challenging problems in graph theory

Discrete Applied Mathematics
Unique perfect phylogeny is intractable

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

Golumbic, Kaplan, and Shamir, in their paper [M.C. Golumbic, H. Kaplan, R. Shamir, Graph sandwich problems, J. Algorithms 19 (1995) 449-473] on graph sandwich problems published in 1995, left the status of sandwich problems for strongly chordal graphs and chordal bipartite graphs open. We prove that the sandwich problem for strongly chordal graphs is NP-complete. We also give some comments on the computational complexity of the sandwich problem for chordal bipartite graphs.