The following pages link to (Q3707420):
Displayed 50 items.
- An O(log n) parallel algorithm for constructing a spanning tree on permutation graphs (Q671937) (← links)
- The smallest networks on which the Ford-Fulkerson maximum flow procedure may fail to terminate (Q672389) (← links)
- Filling gaps in the boundary of a polyhedron (Q673983) (← links)
- Geometric pattern matching under Euclidean motion (Q676592) (← links)
- On the SPANNING \(k\)-TREE problem (Q686254) (← links)
- A genuinely polynomial primal simplex algorithm for the assignment problem (Q686416) (← links)
- Dynamic reachability in planar digraphs with one source and one sink (Q688163) (← links)
- Some comments on building heaps in parallel (Q689637) (← links)
- Selected topics on assignment problems (Q697571) (← links)
- Hopf-algebraic structure of families of trees (Q753918) (← links)
- An 0(n log n) algorithm for the convex bipartite matching problem (Q792885) (← links)
- Higher-dimensional Voronoi diagrams in linear expected time (Q804320) (← links)
- The maximum flow problem: A max-preflow approach (Q811325) (← links)
- Maximizing profits of routing in WDM networks (Q813327) (← links)
- A sausage heuristic for Steiner minimal trees in three-dimensional Euclidean space (Q814961) (← links)
- Minimum spanning trees in networks with varying edge weights (Q863566) (← links)
- A data structure useful for finding Hamiltonian cycles (Q909446) (← links)
- Dynamic maintenance of planar digraphs, with applications (Q911751) (← links)
- Hidden surface removal for rectangles (Q918209) (← links)
- Solving k-shortest and constrained shortest path problems efficiently (Q918435) (← links)
- Reconstructing shortest paths (Q918442) (← links)
- An efficient algorithm for the minimum capacity cut problem (Q922927) (← links)
- Two methods for the generation of chordal graphs (Q940844) (← links)
- Efficient algorithms for machine scheduling problems with earliness and tardiness penalties (Q940876) (← links)
- Expanding neighborhood search-GRASP for the probabilistic traveling salesman problem (Q941025) (← links)
- Some approximation algorithms for the clique partition problem in weighted interval graphs (Q995565) (← links)
- A constrained edit distance algorithm between semi-ordered trees (Q1006058) (← links)
- General algorithms for the address calculation of lexicographically ordered tuples (Q1068557) (← links)
- Sequential access in splay trees takes linear time (Q1072706) (← links)
- Scaling algorithms for network problems (Q1079135) (← links)
- Experimentation in optimization (Q1084342) (← links)
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphs (Q1086246) (← links)
- The pairing heap: A new form of self-adjusting heap (Q1087333) (← links)
- Shortest paths in Euclidean graphs (Q1087335) (← links)
- An augmenting path algorithm for linear matroid parity (Q1087880) (← links)
- Activity optimization games with complementarity (Q1091957) (← links)
- A linear-time algorithm for finding a minimum spanning pseudoforest (Q1098629) (← links)
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons (Q1101226) (← links)
- Incremental evaluation for attribute grammars with unrestricted movement between tree modifications (Q1103412) (← links)
- Communication-efficient parallel algorithms for distributed random-access machines (Q1104096) (← links)
- The general maximum matching algorithm of Micali and Vazirani (Q1105385) (← links)
- On common edges in optimal solutions to traveling salesman and other optimization problems (Q1105496) (← links)
- A sequential dual simplex algorithm for the linear assignment problem (Q1108928) (← links)
- An application of discrete mathematics in the design of an open pit mine (Q1110451) (← links)
- The generation of random permutations on the fly (Q1111400) (← links)
- On the efficiency of maximum-flow algorithms on networks with small integer capacities (Q1111460) (← links)
- A computational study of efficient shortest path algorithms (Q1112733) (← links)
- An efficient algorithm for the Brownian dynamics simulation of aggregation (Q1115084) (← links)
- Making data structures persistent (Q1117690) (← links)
- Fast heuristic algorithms for rectilinear Steiner trees (Q1118419) (← links)