The following pages link to Hristo N. Djidjev (Q452000):
Displayed 9 items.
- Fast algorithms for maintaining shortest paths in outerplanar and planar digraphs (Q5055890) (← links)
- A linear algorithm for the maximal planar subgraph problem (Q5057449) (← links)
- An O(n log n) algorithm for computing a link center in a simple polygon (Q5096146) (← links)
- (Q5298936) (← links)
- Approximate Shortest Path Queries on Weighted Polyhedral Surfaces (Q5756700) (← links)
- Solving larger maximum clique problems using parallel quantum annealing (Q6098277) (← links)
- Planarization of graphs embedded on surfaces (Q6122212) (← links)
- Noise Dynamics of Quantum Annealers: Estimating the Effective Noise Using Idle Qubits (Q6410515) (← links)
- Posiform Planting: Generating QUBO Instances for Benchmarking (Q6446994) (← links)