Complexity and algorithms for graph and hypergraph sandwich problems
type: Item
instance of: scholarly article
title: Complexity and algorithms for graph and hypergraph sandwich problems
zbMATH Open document ID: 0906.68109
author: Martin Charles Golumbic
author: Amir Wassermann
published in: Graphs and Combinatorics
publication date: 1998-10-14T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C50
zbMATH DE Number: 1211724
zbMATH Keywords: hypergraph sandwich problem
MaRDI profile type: Publication
full work available at URL: s003730050028
OpenAlex ID: W2053455138
DOI: 10.1007/S003730050028
Recommended article: Algorithms and complexity of sandwich problems in graphs (extended abstract)
Recommended article: Q4414488
Recommended article: On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs
Recommended article: On (k,ℓ)-Graph Sandwich Problems
Recommended article: Complexity issues for the sandwich homogeneous set problem
Recommended article: The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem
Recommended article: Total exchange algorithms on 'sandwich graphs'
Recommended article: Graph Sandwich Problems
Recommended article: On the Complexity of Probe and Sandwich Problems for Generalized Threshold Graphs
Recommended article: On decision and optimization (\(k\),\(l\))-graph sandwich problems
description: scientific article; zbMATH DE number 1211724