Pages that link to "Item:Q78129"
From MaRDI portal
The following pages link to A note on two problems in connexion with graphs (Q78129):
Displaying 50 items.
- An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem (Q486397) (← links)
- Dynamics of confined crowd modelled using fermionic operators (Q487382) (← links)
- Improvement of path analysis algorithm in social networks based on HBase (Q489703) (← links)
- Algorithms for the minimum diameter terminal Steiner tree problem (Q489734) (← links)
- Value-at-Risk model for hazardous material transportation (Q490229) (← links)
- A more realistic approach for airport ground movement optimisation with stand holding (Q490362) (← links)
- A reduction approach to the two-campus transport problem (Q490382) (← links)
- Maximum probability shortest path problem (Q491594) (← links)
- Processing time-dependent shortest path queries without pre-computed speed information on road networks (Q497898) (← links)
- Fractional virus epidemic model on financial networks (Q501618) (← links)
- Convergence analysis of the fast sweeping method for static convex Hamilton-Jacobi equations (Q504045) (← links)
- A new approach for solving the network problems (Q505104) (← links)
- A new algorithm to compute Pareto-optimal paths in a multi objective fuzzy weighted network (Q505166) (← links)
- A modified active set algorithm for transportation discrete network design bi-level problem (Q506465) (← links)
- Efficient processing of \textit{continuous min-max distance bounded query} with updates in road networks (Q506709) (← links)
- Network majority on tree topological network (Q510545) (← links)
- Multicolour paths in graphs: NP-hardness, algorithms, and applications on routing in WDM networks (Q511728) (← links)
- Pareto optimal solutions providing optimal routes between every two different nodes in the cost-time trade-off routing network without the objectives being prioritized (Q522430) (← links)
- Finding a shortest non-zero path in group-labeled graphs via permanent computation (Q524371) (← links)
- A fast minimum spanning tree algorithm based on \(K\)-means (Q527132) (← links)
- Incremental single-source shortest paths in digraphs with arbitrary positive arc weights (Q528469) (← links)
- A language for generic programming in the large (Q532409) (← links)
- Symbolic approximate time-optimal control (Q533800) (← links)
- Nonlinear tube-fitting for the analysis of anatomical and functional structures (Q542482) (← links)
- Solving the constrained shortest path problem using random search strategy (Q546424) (← links)
- Time-dependent SHARC-routing (Q547279) (← links)
- Fuzzy quadratic minimum spanning tree problem (Q556109) (← links)
- A dynamic program with fathoming and dynamic upper bounds for the assembly line balancing problem (Q582208) (← links)
- Computing the shortest essential cycle (Q603870) (← links)
- Distributed approach for solving time-dependent problems in multimodal transport networks (Q606185) (← links)
- Two-level heaps: a new priority queue structure with applications to the single source shortest path problem (Q607658) (← links)
- Point-to-point shortest paths on dynamic time-dependent road networks (Q607878) (← links)
- A history of graph entropy measures (Q621629) (← links)
- Finding the shortest paths by node combination (Q632873) (← links)
- A quadratic algorithm for finding next-to-shortest paths in graphs (Q639280) (← links)
- Energy-efficient paths in radio networks (Q639290) (← links)
- On numerical characterization of proteomics maps based on partitioning of 2-D maps into Voronoi regions (Q645180) (← links)
- Optimization of heuristic search using recursive algorithm selection and reinforcement learning (Q647446) (← links)
- A method to optimize evacuation instructions (Q647510) (← links)
- Mobile object evasion from detection by a group of observers (Q650013) (← links)
- Fast equal and biased distance fields for medial axis transform with meshing in mind (Q651783) (← links)
- Extended beam search for non-exhaustive state space analysis (Q652163) (← links)
- Hexagon-based all-quadrilateral mesh generation with guaranteed angle bounds (Q653754) (← links)
- A survey of geodesic paths on 3D surfaces (Q654287) (← links)
- Grammar semantics, analysis and parsing by abstract interpretation (Q655410) (← links)
- Speeding up the Floyd-Warshall algorithm for the cycled shortest path problem (Q656681) (← links)
- An adaptive domain-decomposition technique for parallelization of the fast marching method (Q658651) (← links)
- Shortest path problem with uncertain arc lengths (Q660922) (← links)
- Path planning with divergence-based distance functions (Q668992) (← links)
- A new probabilistic extension of Dijkstra's algorithm to simulate more realistic traffic flow in a smart city (Q669785) (← links)
