The following pages link to Local optimization on graphs (Q1122503):
Displaying 26 items.
- Ordered coloring of grids and related graphs (Q442258) (← links)
- The unbiased black-box complexity of partition is polynomial (Q460634) (← links)
- Ranking-based black-box complexity (Q528852) (← links)
- Graph unique-maximum and conflict-free colorings (Q635736) (← links)
- On the quantum query complexity of local search in two and three dimensions (Q835649) (← links)
- On the black-box complexity of Sperner's Lemma (Q839637) (← links)
- A lower bound for on-line ranking number of a path (Q878626) (← links)
- Optimal vertex ranking of block graphs (Q958305) (← links)
- Enhanced algorithms for local search (Q1045925) (← links)
- Probability and convergence for supra-majority rule with Euclidean preferences (Q1200887) (← links)
- Edge ranking of graphs is hard (Q1392547) (← links)
- On the deterministic complexity of searching local maxima (Q1801675) (← links)
- Dividing and conquering the square (Q1801677) (← links)
- Extending shelling orders and a hierarchy of functions of unimodal simple polytopes (Q1894364) (← links)
- Ordered colourings (Q1896351) (← links)
- On the diameter of tree associahedra (Q1991427) (← links)
- (Strong) conflict-free connectivity: algorithm and complexity (Q2283032) (← links)
- Width, depth, and space: tradeoffs between branching and dynamic programming (Q2287480) (← links)
- Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs (Q2891368) (← links)
- Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity (Q3007613) (← links)
- Ordered Coloring Grids and Related Graphs (Q3408158) (← links)
- Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs (Q3541808) (← links)
- Almost Envy-Freeness with General Valuations (Q5107066) (← links)
- Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds (Q5138782) (← links)
- Representing Fitness Landscapes by Valued Constraints to Understand the Complexity of Local Search (Q5139600) (← links)
- Quantum and classical query complexities of local search are polynomially related (Q5896965) (← links)
