Complexity and algorithms for graph and hypergraph sandwich problems
From MaRDI portal
Publication:1268114
DOI10.1007/s003730050028zbMath0906.68109OpenAlexW2053455138MaRDI QIDQ1268114
Martin Charles Golumbic, Amir Wassermann
Publication date: 14 October 1998
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s003730050028
Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (12)
The graph sandwich problem for 1-join composition is NP-complete ⋮ On decision and optimization (\(k\),\(l\))-graph sandwich problems ⋮ The pair completion algorithm for the homogeneous set sandwich problem ⋮ The external constraint 4 nonempty part sandwich problem ⋮ The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem ⋮ The sandwich problem for cutsets: clique cutset, \(k\)-star cutset ⋮ On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs ⋮ The graph sandwich problem for \(P_4\)-sparse graphs ⋮ Unnamed Item ⋮ On probe interval graphs ⋮ Tree Projections: Game Characterization and Computational Aspects ⋮ Matrix sandwich problems
This page was built for publication: Complexity and algorithms for graph and hypergraph sandwich problems
