Pages that link to "Item:Q78129"

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

Displaying 50 items.

• Searching among intervals and compact routing tables (Q4630246) (← links)
• Finding real-valued single-source shortest paths in o(n 3) expected time (Q4645916) (← links)
• COMPUTING THE STRETCH FACTOR AND MAXIMUM DETOUR OF PATHS, TREES, AND CYCLES IN THE NORMED SPACE (Q4650090) (← links)
• Eigenproblem for monotone and toeplitz matrices in a Max-algebra (Q4656061) (← links)
• Cost-effective modeling for natural resource distribution systems (Q4665370) (← links)
• An adaptive memory programming method for risk logistics operations (Q4678215) (← links)
• Computing Pareto-Optimal Transit Routes Through Mathematical Algorithms (Q4685792) (← links)
• Extensions of labeling algorithms for multi‐objective uncertain shortest path problems (Q4687213) (← links)
• Fast Entropic Regularized Optimal Transport Using Semidiscrete Cost Approximation (Q4691179) (← links)
• A network flow approach to a city emergency evacuation planning (Q4717403) (← links)
• The computation of nearly minimal Steiner trees in graphs (Q4750659) (← links)
• The Bounded Path Tree Problem (Q4750668) (← links)
• Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problem (Q4772973) (← links)
• AN APPROACH TO TRIP- AND ROUTE-PLANNING PROBLEMS (Q4781411) (← links)
• The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization (Q4789079) (← links)
• A Dimension-Reduction Algorithm for Multi-Stage Decision Problems with Returns in a Partially Ordered Set (Q4809666) (← links)
• Optimal schedules with infinitely large stability radius^∗ (Q4836770) (← links)
• Application of genetic algorithm to a parallel path selection problem (Q4882359) (← links)
• The Geometry of Nonparametric Filament Estimation (Q4916513) (← links)
• Multicriteria path and tree problems: discussion on exact algorithms and applications (Q4918252) (← links)
• Minimal functional routes in directed graphs with dependent edges (Q4924061) (← links)
• Dynamic programming approaches to solve the shortest path problem with forbidden paths (Q4924113) (← links)
• Average-case complexity of shortest-paths problems in the vertex-potential model (Q4943352) (← links)
• An efficient exact approach for the constrained shortest path tour problem (Q4972542) (← links)
• A NOVEL METHOD FOR MEASURING THE STRUCTURAL INFORMATION CONTENT OF NETWORKS (Q4981789) (← links)
• Real-time Traffic Assignment Using Engineered Customizable Contraction Hierarchies (Q4984867) (← links)
• The Effect of Adding Randomly Weighted Edges (Q4992839) (← links)
• Selfishness Need Not Be Bad (Q4994166) (← links)
• Single-Source Bottleneck Path Algorithm Faster than Sorting for Sparse Graphs. (Q5002718) (← links)
• Improved Time Bounds for All Pairs Non-decreasing Paths in General Digraphs (Q5002719) (← links)
• Algorithmic Building Blocks for Asymmetric Memories (Q5009607) (← links)
• A novel ant colony optimization algorithm for the shortest-path problem in traffic networks (Q5024603) (← links)
• An innovative, highly efficient and expertise-free mechanism reduction method: important species identification through species’ participation in element fluxes (Q5030811) (← links)
• Shortest path reoptimization vs resolution from scratch: a computational comparison (Q5043855) (← links)
• Semi-dynamic shortest paths and breadth-first search in digraphs (Q5047157) (← links)
• Combining Voronoi Graph and Spline-Based Approaches for a Mobile Robot Path Planning (Q5053633) (← links)
• Dynamic Shapley Value for Two-Stage Cost Sharing Game (Q5054480) (← links)
• Finding shortest paths in the presence of orthogonal obstacles using a combined L 1 and link metric (Q5056105) (← links)
• Efficient parallel algorithms for shortest paths in planar graphs (Q5056111) (← links)
• Optimizing the Distribution of Dairy Products by Heuristic Algorithms and Geographic Information System: A Case Study of FARS PEGAH DAIRY COMPANY (Q5056890) (← links)
• Routing with delays when storage is costly (Q5057444) (← links)
• An efficient algorithm for solving the median problem on real road networks (Q5059369) (← links)
• A fully dynamic approximation scheme for all-pairs shortest paths in planar graphs (Q5060135) (← links)
• Efficient approximate shortest-path queries among isothetic rectangular obstacles (Q5060142) (← links)
• Prime stars multiplexes (Q5061288) (← links)
• On the route construction in changing environments using solutions of the eikonal equation (Q5067411) (← links)
• (Q5075788) (← links)
• Engineering Negative Cycle Canceling for Wind Farm Cabling (Q5075800) (← links)
• The exponential distribution analog of the Grubbs–Weaver method (Q5077397) (← links)
• On Restricted Disjunctive Temporal Problems: Faster Algorithms and Tractability Frontier (Q5079776) (← links)