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.
- Routing on heavy-path WSPD-spanners (Q832910) (← links)
- Routing of uncertain traffic demands (Q833385) (← links)
- Weighted \(A^*\) search - unifying view and application (Q840833) (← links)
- A hill-jump algorithm of Hopfield neural network for shortest path problem in communication network (Q841973) (← links)
- A dynamic transportation model for the Stockholm area: Implementation issues regarding departure time choice and OD-pair reduction (Q844137) (← links)
- Balancing minimum spanning trees and multiple-source minimum routing cost spanning trees on metric graphs (Q845678) (← links)
- Optimal length resolution refutations of difference constraint systems (Q846163) (← links)
- Note on the structure of Kruskal's algorithm (Q848958) (← 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)
- Tree decomposition-based indexing for efficient shortest path and nearest neighbors query answering on graphs (Q891679) (← links)
- A neural network algorithm for servicing jobs with sequential and parallel machines (Q893921) (← links)
- Combining fractal and deterministic walkers for texture analysis and classification (Q898054) (← links)
- 3D shape retrieval using kernels on extended Reeb graphs (Q898055) (← links)
- Lower bound sets for biobjective shortest path problems (Q905755) (← links)
- Algorithms for searching paths in huge graphs (Q906255) (← 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)
- New models for shortest path problem with fuzzy arc lengths (Q924789) (← links)
- Shape analysis for automated sulcal classification and parcellation of MRI data (Q927176) (← links)
- Global optimal control of perturbed systems (Q927215) (← links)
- Optimal paths in bi-attribute networks with fractional cost functions (Q928022) (← links)
- Constructing minimum-interference networks (Q929744) (← links)
- Applying the pilot method to improve VNS and GRASP metaheuristics for the design of SDH/WDM networks (Q932187) (← links)
- Structural information content of networks: graph entropy based on local vertex functionals (Q936078) (← links)
- Video enhancement using adaptive spatio-temporal connective filter and piecewise mapping (Q938982) (← links)
- Labeling algorithm for the shortest path problem with turn prohibitions with application to large-scale road networks (Q940859) (← links)
- A double scaling algorithm for the constrained maximum flow problem (Q941539) (← links)
- A second order discontinuous Galerkin fast sweeping method for eikonal equations (Q942262) (← links)
- Information processing in complex networks: Graph entropy and information functionals (Q945216) (← links)
- Exploiting planarity in separation routines for the symmetric traveling salesman problem (Q951094) (← links)
