Pages that link to "Item:Q78129"

The following pages link to A note on two problems in connexion with graphs (Q78129):

Displaying 50 items.

• Finding rectilinear least cost paths in the presence of convex polygonal congested regions (Q955608) (← links)
• On-line robust trajectory generation on approach and landing for reusable launch vehicles (Q963970) (← links)
• Object delineation by \(\kappa \)-connected components (Q966749) (← links)
• A faster algorithm for the single source shortest path problem with few distinct positive lengths (Q972360) (← links)
• A metaheuristic approach to the urban transit routing problem (Q972642) (← links)
• Approximate shortest paths guided by a small index (Q973004) (← links)
• Bottleneck flows in unit capacity networks (Q976109) (← links)
• Improved algorithms for the \(k\) simple shortest paths and the replacement paths problems (Q976116) (← links)
• Single source shortest paths in \(H\)-minor free graphs (Q986535) (← links)
• Using matrices to link conflict evolution and resolution in a graph model (Q992610) (← links)
• The \(k\)-centrum shortest path problem (Q997931) (← links)
• Fast image inpainting based on coherence transport (Q1009212) (← links)
• A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem (Q1014948) (← links)
• Finding the anti-block vital edge of a shortest path between two nodes (Q1016036) (← links)
• Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem (Q1016064) (← links)
• ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems (Q1016355) (← links)
• Approximate labelled subtree homeomorphism (Q1018101) (← links)
• Finding non-dominated bicriteria shortest pairs of disjoint simple paths (Q1025230) (← links)
• An \(O(n^{5/2}\log n)\) algorithm for the rectilinear minimum link-distance problem in three dimensions (Q1025292) (← links)
• Asymmetric distances, semidirected networks and majority in Fermat-Weber problems (Q1026590) (← links)
• Efficient reconstruction of metabolic pathways by bidirectional chemical search (Q1026637) (← links)
• A new bidirectional search algorithm with shortened postprocessing (Q1026755) (← links)
• An extension of labeling techniques for finding shortest path trees (Q1027584) (← links)
• Combinatorial optimization in system configuration design (Q1027725) (← links)
• Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation (Q1028460) (← links)
• Topology representing networks for the visualization of manifolds (Q1040794) (← links)
• On the \(K\) shortest path trees problem (Q1040982) (← links)
• Flows with unit path capacities and related packing and covering problems (Q1041430) (← links)
• A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing (Q1044022) (← links)
• On the system optimum of traffic assignment in \(M/G/c/c\) state-dependent queueing networks (Q1044153) (← links)
• Developing topology discovery in Event-B (Q1044181) (← links)
• An O(m log log D) algorithm for shortest paths (Q1053460) (← links)
• Finding shortest paths in the plane in the presence of barriers to travel (for any \(l_ p\)-norm) (Q1058966) (← links)
• Network flows with age dependent decay rates (Q1060129) (← links)
• An extension of set partitioning with application to scheduling problems (Q1060959) (← links)
• Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time (Q1062764) (← links)
• The fleet size and mix problem for capacitated arc routing (Q1064973) (← links)
• The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm (Q1068720) (← links)
• Microcomputer-based algorithms for large scale shortest path problems (Q1072451) (← links)
• An improvement of Dijkstra's method for finding a shortest path in a graph (Q1072570) (← links)
• An introduction to parallelism in combinatorial optimization (Q1076605) (← links)
• Scaling algorithms for network problems (Q1079135) (← links)
• An algorithm for shortest-path motion in three dimensions (Q1082820) (← links)
• A shortest-route approach for optimum aggregation of data with an application to income data (Q1085053) (← links)
• A shortest augmenting path algorithm for dense and sparse linear assignment problems (Q1085784) (← links)
• Optimal paths in probabilistic networks: A case with temporary preferences (Q1086176) (← links)
• The shortest-path problem for graphs with random arc-lengths (Q1086251) (← links)
• Edge exchanges in the degree-constrained minimum spanning tree problem (Q1086497) (← links)
• Shortest paths in Euclidean graphs (Q1087335) (← links)
• Algorithms for finding k-best perfect matchings (Q1090343) (← links)