Pages that link to "Item:Q78129"

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

Displaying 50 items.

• Network design to anticipate selfish evacuation routing (Q339932) (← links)
• Road network emergency accessibility planning after a major earthquake (Q339942) (← links)
• Bi-criteria sequencing of courses and formation of classes for a bottleneck classroom (Q342113) (← links)
• Data-driven approaches for emissions-minimized paths in urban areas (Q342252) (← links)
• An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows and scheduled lines (Q342360) (← links)
• The constrained shortest path tour problem (Q342457) (← links)
• New reformulations of distributionally robust shortest path problem (Q342487) (← links)
• Efficient symbolic search for cost-optimal planning (Q343909) (← links)
• A study on several combination problems of classic shop scheduling and shortest path (Q344790) (← links)
• A uniformly second order fast sweeping method for eikonal equations (Q346348) (← links)
• A gradient augmented level set method for unstructured grids (Q348553) (← links)
• Dijkstra's algorithm for solving the shortest path problem on networks under intuitionistic fuzzy environment (Q359406) (← links)
• Analysis of average shortest-path length of scale-free network (Q364556) (← links)
• Computing Freidlin's cycles for the overdamped Langevin dynamics. Application to the Lennard-Jones-38 cluster (Q369672) (← links)
• Metaheuristics with disposal facility positioning for the waste collection VRP with time windows (Q375982) (← links)
• Choosing optimal road trajectory with random work cost in different areas (Q384698) (← links)
• Optimal working time distribution and routing for autonomous tractors based on heuristic algorithms (Q386924) (← links)
• Simulation relations for pattern matching in directed graphs (Q388784) (← links)
• A MDP approach to fault-tolerant routing (Q389801) (← links)
• Fast query structures in anisotropic media (Q391227) (← links)
• Sharing information for the all pairs shortest path problem (Q391758) (← links)
• A novel method for planning a staged evacuation (Q394385) (← links)
• Three-objective subgraph mining using multiobjective evolutionary programming (Q394981) (← links)
• On the second point-to-point undirected shortest simple path problem (Q395858) (← links)
• Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs (Q396709) (← links)
• Algorithms to test open set condition for self-similar set related to P.V. numbers (Q401376) (← links)
• Hyperspherical embedding of graphs and networks in communicability spaces (Q403566) (← links)
• A new tangentially stabilized 3D curve evolution algorithm and its application in virtual colonoscopy (Q404154) (← links)
• An improved algorithm for the red-blue hitting set problem with the consecutive ones property (Q407573) (← links)
• Physical portrayal of computational complexity (Q408483) (← links)
• Nonlinear dimensionality reduction by topologically constrained isometric embedding (Q408807) (← links)
• Path Laplacian matrices: introduction and application to the analysis of consensus in networks (Q417470) (← links)
• Coping with selfish on-going behaviors (Q418112) (← links)
• K\(^{\ast}\): A heuristic search algorithm for finding the \(k\) shortest paths (Q420803) (← links)
• Packing cycles exactly in polynomial time (Q421271) (← links)
• A multi-round generalization of the traveling tournament problem and its application to Japanese baseball (Q421692) (← links)
• Building texture evolution networks for deformation processing of polycrystalline fcc metals using spectral approaches: applications to process design for targeted performance (Q422662) (← links)
• A multicast routing algorithm based on searching in directed graph (Q426417) (← links)
• Some graft transformations and its applications on the distance spectral radius of a graph (Q427598) (← links)
• On shortest disjoint paths in planar graphs (Q429668) (← links)
• An efficient label setting/correcting shortest path algorithm (Q434184) (← links)
• A comparison of heuristic best-first algorithms for bicriterion shortest path problems (Q439323) (← links)
• An efficient time and space \(K\) point-to-point shortest simple paths algorithm (Q449479) (← links)
• The saga of minimum spanning trees (Q458468) (← links)
• On the complexity of synthesizing a minimum-weighted supervisor under partial observation (Q458885) (← links)
• Motion planning algorithms for molecular simulations: a survey (Q465699) (← links)
• Data mining of social networks represented as graphs (Q465703) (← links)
• Integrating the supervised information into unsupervised learning (Q474417) (← links)
• Location-allocation models for traffic police patrol vehicles on an interurban network (Q478026) (← links)
• Computing the asymptotic spectrum for networks representing energy landscapes using the minimum spanning tree (Q480081) (← links)