scientific article; zbMATH DE number 2230229
From MaRDI portal
Publication:5708521
zbMath1075.90553MaRDI QIDQ5708521
Rafael B. Teixeira, Celina M. Herrera de Figueiredo
Publication date: 18 November 2005
Full work available at URL: http://www.sciencedirect.com/science/journal/15710653
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (2)
The pair completion algorithm for the homogeneous set sandwich problem ⋮ On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The homogeneous set sandwich problem
- Star-cutsets and perfect graphs
- An algorithm for finding clique cut-sets
- Complexity and algorithms for graph and hypergraph sandwich problems
- On stable cutsets in graphs
- The graph sandwich problem for 1-join composition is NP-complete
- Graph Sandwich Problems
- Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques
This page was built for publication: