Pages that link to "Item:Q1268114"

The following pages link to Complexity and algorithms for graph and hypergraph sandwich problems (Q1268114):

Displaying 10 items.

• The external constraint 4 nonempty part sandwich problem (Q531610) (← 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)
• 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)
• The sandwich problem for cutsets: clique cutset, \(k\)-star cutset (Q2500527) (← links)