Pages that link to "Item:Q2641866"
From MaRDI portal
The following pages link to Genus characterizes the complexity of certain graph problems: Some tight results (Q2641866):
Displaying 7 items.
- On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability (Q1680511) (← links)
- A completely positive formulation of the graph isomorphism problem and its positive semidefinite relaxation (Q2023115) (← links)
- Revising Johnson's table for the 21st century (Q2091799) (← links)
- The genus of the balanced hypercube (Q2798321) (← links)
- Stronger ILPs for the Graph Genus Problem. (Q5075767) (← links)
- (Q5088957) (← links)
- Maximum Cut Parameterized by Crossing Number (Q5119374) (← links)
