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.
- Adaptive routing for quantum memory failures in the quantum Internet (Q669926) (← 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)
- Analysis of farthest point sampling for approximating geodesics in a graph (Q679744) (← links)
- A highly scalable massively parallel fast marching method for the eikonal equation (Q680108) (← links)
- A generalized approximation framework for fractional network flow and packing problems (Q684147) (← 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)
- The minimum weight \(t\)-composition of an integer (Q690540) (← links)
- Complexity analysis and optimization of the shortest path tour problem (Q691420) (← links)
- Sequencing and scheduling for filling lines in dairy production (Q691446) (← 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)
- Derivatives with respect to metrics and applications: subgradient marching algorithm (Q707576) (← links)
- Integrated task assignment and path optimization for cooperating uninhabited aerial vehicles using genetic algorithms (Q709151) (← links)
- A survey of graph edit distance (Q710632) (← links)
- Laplacian centrality: A new centrality measure for weighted networks (Q712485) (← links)
- Voronoi-based range and continuous range query processing in mobile databases (Q716304) (← links)
- A vehicle routing problem with pickup and delivery time windows, and coordination of transportable resources (Q716354) (← links)
- Path optimization with limited sensing ability (Q729301) (← links)
- Hybrid massively parallel fast sweeping method for static Hamilton-Jacobi equations (Q729573) (← links)
- A matrix-based approach to searching colored paths in a weighted colored multidigraph (Q732496) (← links)
- On a pair of job-machine assignment problems with two stages (Q732901) (← links)
- From reaction-diffusion to physarum computing (Q734218) (← links)
- Distributed detection/localization of change-points in high-dimensional network traffic data (Q746229) (← links)
- High-performance simulation-based algorithms for an alpine ski racer's trajectory optimization in heterogeneous computer systems (Q747401) (← 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)
- From bogtrotting to herding: a UCD perspective (Q766290) (← links)
- Dynamic programming bi-criteria combinatorial optimization (Q777429) (← links)
- Evasive path planning under surveillance uncertainty (Q778086) (← links)
- Uncertain random shortest path problem (Q781302) (← 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)
- Heuristic search for one-to-many shortest path queries (Q825009) (← links)
- Leader nodes in communities for information spreading (Q832130) (← links)
- Functional correctness of C implementations of Dijkstra's, Kruskal's, and Prim's algorithms (Q832310) (← links)
- On the spanning and routing ratios of the directed \(\varTheta_6\)-graph (Q832828) (← links)
