Pages that link to "Item:Q1230637"
From MaRDI portal
The following pages link to Some simplified NP-complete graph problems (Q1230637):
Displaying 15 items.
- Branch and bound for the cutwidth minimization problem (Q339558) (← links)
- On star and caterpillar arboricity (Q1025569) (← links)
- Vertex- and edge-minimal and locally minimal graphs (Q1043552) (← links)
- Graph theoretic closure properties of the family of boundary NLC graph languages (Q1084870) (← links)
- Expressing combinatorial optimization problems by linear programs (Q1186549) (← links)
- Consistency in networks of relations (Q1231783) (← links)
- On the communication complexity of zero-knowledge proofs (Q1261016) (← links)
- Computational aspects of greedy partitioning of graphs (Q1702844) (← links)
- Approximation and dependence via multiteam semantics (Q1783737) (← links)
- Facility location problems: a parameterized view (Q2275913) (← links)
- A binarisation heuristic for non-convex quadratic programming with box constraints (Q2294229) (← links)
- CHECKCOL: improved local search for graph coloring (Q2458929) (← links)
- Exact algorithms for the Hamiltonian cycle problem in planar graphs (Q2494820) (← links)
- The Complexity of Coloring Circular Arcs and Chords (Q3964622) (← links)
- On approximation properties of the Independent set problem for degree 3 graphs (Q5057456) (← links)
