The following pages link to (Q3707420):
Displaying 50 items.
- A multiperiod min-sum arborescence problem (Q260662) (← links)
- A dual approach for solving the combined distribution and assignment problem with link capacity constraints (Q264302) (← links)
- Gallai-Edmonds decomposition as a pruning technique (Q301487) (← links)
- Tight bounds for distributed minimum-weight spanning tree verification (Q372968) (← links)
- Finding dominators via disjoint set union (Q396673) (← links)
- The disjoint paths problem in quadratic time (Q412168) (← links)
- The saga of minimum spanning trees (Q458468) (← links)
- Hybrid Bellman-Ford-Dijkstra algorithm (Q511150) (← links)
- Position heaps: a simple and dynamic text indexing data structure (Q533414) (← links)
- The extended global cardinality constraint: an empirical survey (Q543616) (← links)
- Efficient authenticated data structures for graph connectivity and geometric search problems (Q548654) (← links)
- Computing large matchings in planar graphs with fixed minimum degree (Q553342) (← links)
- Shortest path and maximum flow problems in networks with additive losses and gains (Q620954) (← links)
- Fréchet distance with speed limits (Q621928) (← links)
- A kinetic triangulation scheme for moving points in the plane (Q632719) (← links)
- Finding the shortest paths by node combination (Q632873) (← links)
- An efficient scaling algorithm for the minimum weight bibranching problem (Q652532) (← links)
- 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)
- Computing pseudotriangulations via branched coverings (Q714984) (← links)
- An algorithmic study of switch graphs (Q715049) (← links)
- Hopf-algebraic structure of families of trees (Q753918) (← links)
- Rank-two 5d SCFTs from M-theory at isolated toric singularities: a systematic study (Q780896) (← 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)
- A stronger lower bound on parametric minimum spanning trees (Q832875) (← links)
- Multiple phase neighborhood search---GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP (Q841596) (← links)
- Minimum spanning trees in networks with varying edge weights (Q863566) (← links)
- \(n\)-step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem (Q896282) (← 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)
- Computing the arrangement of circles on a sphere, with applications in structural biology (Q924070) (← 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)
- An implicit representation of chordal comparability graphs in linear time (Q972319) (← links)
