The pair completion algorithm for the homogeneous set sandwich problem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1003286 (Why is no real title available?)
- scientific article; zbMATH DE number 2230229 (Why is no real title available?)
- A note on finding all homogeneous set sandwiches
- Algorithms for the homogeneous set sandwich problem
- An efficient algorithm for solving the homogeneous set sandwich problem
- Bounded degree interval sandwich problems
- Complexity and algorithms for graph and hypergraph sandwich problems
- Depth-First Search and Linear Graph Algorithms
- Efficient and practical algorithms for sequential modular decomposition
- Graph Sandwich Problems
- Normal hypergraphs and the perfect graph conjecture
- Note on the homogeneous set sandwich problem
- On decision and optimization (\(k\),\(l\))-graph sandwich problems
- The graph sandwich problem for 1-join composition is NP-complete
- The homogeneous set sandwich problem
Cited in
(10)- The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem
- An efficient algorithm for solving the homogeneous set sandwich problem
- On the bi-enhancement of chordal-bipartite probe graphs
- scientific article; zbMATH DE number 4090793 (Why is no real title available?)
- Note on the homogeneous set sandwich problem
- Competitive graph searches
- Complexity issues for the sandwich homogeneous set problem
- A note on finding all homogeneous set sandwiches
- Algorithms for the homogeneous set sandwich problem
- The homogeneous set sandwich problem
This page was built for publication: The pair completion algorithm for the homogeneous set sandwich problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q844163)