Pages that link to "Item:Q78129"
From MaRDI portal
The following pages link to A note on two problems in connexion with graphs (Q78129):
Displayed 50 items.
- roads (Q78130) (← links)
- cppRouting (Q81937) (← links)
- locationgamer (Q131991) (← 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)
- Solving the shortest-paths problem on bipartite permutation graphs efficiently (Q672656) (← links)
- Approximately matching context-free languages (Q673469) (← links)
- Efficient parallel algorithms for computing all pair shortest paths in directed graphs (Q676269) (← links)
- Dynamic algorithms for shortest paths in planar graphs (Q685367) (← links)
- Linear-space best-first search (Q685539) (← links)
- Routing with nonlinear multiattribute cost functions (Q686201) (← links)
- Improving the location of minisum facilities through network modification (Q689226) (← links)
- Ear decomposition for pair comparison data (Q696936) (← links)
- Development of the tree-based link labeling algorithm for optimal path-finding in urban transportation networks (Q699346) (← links)
- Axiomatization of the Shapley value on minimum cost spanning tree games (Q700116) (← links)
- Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries (Q707138) (← links)
- Bounding probabilistic relationships in Bayesian networks using qualitative influences: methods and applications (Q707245) (← links)
- The chance constrained critical path with location-scale distributions (Q759649) (← links)
- A result on the computational complexity of heuristic estimates for the \(A^*\) algorithm (Q761039) (← links)
- A priority queue for the all pairs shortest path problem (Q794155) (← links)
- Shortest paths in networks with vector weights (Q795755) (← links)
- Minimum deviation and balanced optimization: A unified approach (Q806674) (← links)
- A new algorithm for the quasi-assignment problem (Q808992) (← links)
- A linear time algorithm for the maximum capacity path problem (Q809905) (← links)
- A parametric approach to solving bicriterion shortest path problems (Q810382) (← links)
- Regular algebra applied to language problems (Q817577) (← links)
- A heuristic approach for combined equipment-planning and routing in multi-layer SDH/WDM networks (Q819071) (← links)
- Dynamic shortest paths and transitive closure: algorithmic techniques and data structures (Q849628) (← links)
- Segmentation and classification of high resolution imagery for mapping individual species in a closed canopy, deciduous forest (Q854625) (← links)
- Routing of a hazmat truck in the presence of weather systems (Q856789) (← links)
- Shortest path problem on a network with imprecise edge weight (Q857907) (← links)
- Optimal routing for maximizing the travel time reliability (Q862490) (← links)
- A flexible adaptive memory-based algorithm for real-life transportation operations: two case studies from dairy and construction sector (Q863996) (← links)
- Solving shortest paths efficiently on nearly acyclic directed graphs (Q868945) (← links)
- Approximate analysis of \(M/G/c/c\) state-dependent queueing networks (Q868996) (← links)
- An improved Dijkstra's shortest path algorithm for sparse network (Q870157) (← links)
- Finding shortest path in the presence of barriers: an alternate approach (Q870173) (← links)
- Two fast algorithms for all-pairs shortest paths (Q875428) (← links)
- Analysis of contract net in multi-agent systems (Q875967) (← links)
- Algorithms for shortest paths and \(d\)-cycle problems (Q876687) (← links)
- On the enrouting protocol problem under uncertainty (Q877076) (← links)
- Algorithms and the calculation of Nash equilibria for multi-objective control of time-discrete systems and polynomial-time algorithms for dynamic \(c\)-games on networks (Q877607) (← links)
- Approximate distance oracles for graphs with dense clusters (Q883232) (← links)
- Link test -- a statistical method for finding prostate cancer biomarkers (Q884272) (← links)
- Topological mappings between graphs, trees and generalized trees (Q884588) (← links)
- An adaptive parallel algorithm for analyzing activity networks (Q910339) (← links)
- A new \(O(n^ 2)\) shortest chain algorithm (Q911302) (← links)
- A survey of dynamic network flows (Q917417) (← links)
- A distributed shortest path algorithm for a planar network (Q918205) (← links)
- A minimum length covering subgraph of a network (Q920001) (← links)