An efficient algorithm for solving the homogeneous set sandwich problem
From MaRDI portal
Recommendations
Cites work
- \(P_ 4\)-trees and substitution decomposition
- A semi-strong perfect graph theorem
- Depth-First Search and Linear Graph Algorithms
- Graph Sandwich Problems
- Incremental modular decomposition
- Modular decomposition and transitive orientation
- Normal hypergraphs and the perfect graph conjecture
- Parallel concepts in graph theory
- The homogeneous set sandwich problem
Cited in
(9)- A note on finding all homogeneous set sandwiches
- Can transitive orientation make sandwich problems easier?
- The homogeneous set sandwich problem
- scientific article; zbMATH DE number 4090793 (Why is no real title available?)
- Complexity issues for the sandwich homogeneous set problem
- An algorithm for finding homogeneous pairs
- Note on the homogeneous set sandwich problem
- The pair completion algorithm for the homogeneous set sandwich problem
- Algorithms for the homogeneous set sandwich problem
This page was built for publication: An efficient algorithm for solving the homogeneous set sandwich problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1607076)