The complexity of recognizing unique sink orientations
From MaRDI portal
Recommendations
- Geometric optimization and unique sink orientations of cubes
- Counting unique-sink orientations
- One-to-one correspondense between proper families of Boolean functions and unique sink orientations of cubes
- Unique sink orientations of grids
- On the complexity of determining whether there is a unique Hamiltonian cycle or path
Cited in
(10)- Generation of proper families of functions
- Unique end of potential line
- Finding the sink takes some time. An almost quadratic lower bound for finding the sink of unique sink oriented cubes.
- The complexity of all-switches strategy improvement
- Unique End of Potential Line
- Exponential lower bounds for history-based simplex pivot rules on abstract cubes
- One-to-one correspondense between proper families of Boolean functions and unique sink orientations of cubes
- Two choices are enough for P-LCPs, USOs, and colorful tangents
- On flipping edge sets in unique sink orientations
- On degeneracy in the P-matroid oriented matroid complementarity problem
This page was built for publication: The complexity of recognizing unique sink orientations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2955007)