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 ASP-BASED MODEL EMPLOYING A TABU SEARCH METHOD FOR MAKING e-LOGISTICS DECISIONS (Q5405793) (← links)
- From Affiliation Matrices to Adjacency Matrices: Methods and Techniques for the Analysis of Centrality (Q5419510) (← links)
- Modeling Dynamic Vehicle Navigation in a Self-Organizing, Peer-to-Peer, Distributed Traffic Information System (Q5433106) (← links)
- Structural Change and Homeostasis in Organizations: A Decision-Theoretic Approach (Q5436930) (← links)
- Transparallel processing by hyperstrings (Q5460844) (← links)
- A set oriented approach to global optimal control (Q5465550) (← links)
- BRIDGE LANE DIRECTION SPECIFICATION FOR SUSTAINABLE TRAFFIC MANAGEMENT (Q5483428) (← links)
- An efficient parallel algorithm for shortest paths in planar layered digraphs (Q5490027) (← links)
- (Q5491232) (← links)
- Multi-shared-trees based multicast routing control protocol using anycast selection (Q5492121) (← links)
- Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks (Q5505661) (← links)
- UNLEASHING THE VERMIN (VECTORED ROUTE-LENGTH MINIMIZATION) (Q5506112) (← links)
- Ranking One Million Simple Paths in Road Networks (Q5506763) (← links)
- Some problems in discrete optimization (Q5636690) (← links)
- The traveling-salesman problem and minimum spanning trees: Part II (Q5641007) (← links)
- On the time required to detect cycles and connectivity in graphs (Q5641178) (← links)
- Computational experience with a group theoretic integer programming algorithm (Q5671787) (← links)
- Computing and Listing st-Paths in Public Transportation Networks (Q5740180) (← links)
- (Q5743390) (← links)
- Algebraic Theory on Shortest Paths for All Flows (Q5743545) (← links)
- Traffic modelling framework for electric vehicles (Q5745589) (← links)
- SecGDB: Graph Encryption for Exact Shortest Distance Queries with Efficient Updates (Q5854428) (← links)
- (Q5859882) (← links)
- Modifications of the Floyd-Warshall algorithm with nearly quadratic expected-time (Q5862374) (← links)
- On Analysis of Traffic Flow Demultiplexing Effectiveness (Q5866325) (← links)
- Effective algorithm for finding shortest paths in dense Gaussian networks (Q5871442) (← links)
- Space-efficient, fast and exact routing in time-dependent road networks (Q5874554) (← links)
- (Q5875432) (← links)
- Parallel Delivery Operations Modelling (Q5883393) (← links)
- Persistence of Weighted Ordinal Partition Networks for Dynamic State Detection (Q5887845) (← links)
- Accelerated Bend Minimization (Q5895514) (← links)
- Intra-domain traffic engineering with shortest path routing protocols (Q5900973) (← links)
- A faster approximation algorithm for the Steiner problem in graphs (Q5903117) (← links)
- Performance of linear-space search algorithms (Q5917443) (← links)
- Integer priority queues with decrease key in constant time and the single source shortest paths problem (Q5917573) (← links)
- Some graph optimization problems with weights satisfying linear constraints (Q5918487) (← links)
- Delay-constrained minimum shortest path trees and related problems (Q5918729) (← links)
- Intra-domain traffic engineering with shortest path routing protocols (Q5919993) (← links)
- Performance of linear-space search algorithms (Q5925571) (← links)
- An alternative definition for digital convexity (Q5925581) (← links)
- Delay-constrained minimum shortest path trees and related problems (Q5925589) (← links)
- Optimizing the system of virtual paths by tabu search. (Q5928385) (← links)
- Evolution, implementation, and application of level set and fast marching methods for advancing fronts (Q5944031) (← links)
- The shortest path computation in MOSPF protocol using an annealed Hopfield neural network with a new cooling schedule (Q5946278) (← links)
- Fast computation of weighted distance functions and geodesics on implicit hyper-surfaces (Q5956035) (← links)
- Supply facility and input/output point locations in the presence of barriers (Q5959390) (← links)
- Locating stations on rapid transit lines (Q5959393) (← links)
- The cable trench problem: Combining the shortest path and minimum spanning tree problems (Q5959396) (← links)
- On the shortest path problem with negative cost cycles (Q5963684) (← links)
- The \(k\)-distinct language: parameterized automata constructions (Q5964071) (← links)