Pages that link to "Item:Q1268114"
From MaRDI portal
The following pages link to Complexity and algorithms for graph and hypergraph sandwich problems (Q1268114):
Displaying 18 items.
- Complexity issues for the sandwich homogeneous set problem (Q531596) (← links)
- The external constraint 4 nonempty part sandwich problem (Q531610) (← links)
- The chain graph sandwich problem (Q646705) (← links)
- The pair completion algorithm for the homogeneous set sandwich problem (Q844163) (← links)
- On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs (Q995559) (← links)
- The graph sandwich problem for \(P_4\)-sparse graphs (Q1025565) (← links)
- On probe interval graphs (Q1281778) (← links)
- Bounded degree interval sandwich problems (Q1293876) (← links)
- Matrix sandwich problems (Q1307537) (← links)
- The graph sandwich problem for 1-join composition is NP-complete (Q1613390) (← links)
- On decision and optimization (\(k\),\(l\))-graph sandwich problems (Q1887051) (← links)
- The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem (Q2255038) (← links)
- Can transitive orientation make sandwich problems easier? (Q2370442) (← links)
- The sandwich problem for cutsets: clique cutset, \(k\)-star cutset (Q2500527) (← links)
- (Q3113727) (← links)
- Tree-Related Widths of Graphs and Hypergraphs (Q3614197) (← links)
- Tree Projections: Game Characterization and Computational Aspects (Q3655155) (← links)
- (Q5708521) (← links)