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.
- Shortest distances as enumeration problem (Q6184314) (← links)
- Path planning in a weighted planar subdivision under the Manhattan metric (Q6184991) (← links)
- A graph-based approach for positive and unlabeled learning (Q6186980) (← links)
- Computing alignments with maximum synchronous moves via replay in coordinate planes (Q6191633) (← links)
- Program synthesis with best-first bottom-up search (Q6488803) (← links)
- A nested multiple-objective optimization algorithm for managing production fleets in surface mines (Q6495564) (← links)
- Priority queues with decreasing keys (Q6495789) (← links)
- Branch-and-cut-and-price algorithm for the constrained-routing and spectrum assignment problem (Q6495886) (← links)
- Efficient heuristics for determining node-disjoint path pairs visiting specified nodes (Q6496358) (← links)
- Dedicated protection of multicast sessions in mixed-graph sparse-splitting optical networks (Q6496368) (← links)
- High Order Absolutely Convergent Fast Sweeping Methods with Multi-resolution WENO Local Solvers for Eikonal and Factored Eikonal Equations (Q6500186) (← links)
- A new approach for active automata learning based on apartness (Q6535565) (← links)
- Central industries in the Ecuadorian input-output network. An application of social network analysis (Q6537130) (← links)
- The shortest-path and bee colony optimization algorithms for traffic control at single intersection with Networkx application (Q6542560) (← links)
- Crack modeling via minimum-weight surfaces in 3d Voronoi diagrams (Q6543320) (← links)
- Conflict-free electric vehicle routing problem: an improved compositional algorithm (Q6544788) (← links)
- Generalized maximum flow over time with intermediate storage (Q6546986) (← links)
- Efficient algorithms for shortest path queries in planar digraphs (Q6550542) (← links)
- Shortest path algorithms for nearly acyclic directed graphs (Q6550559) (← links)
- An improved solution methodology for the urban transit routing problem (Q6551086) (← links)
- An introduction to parallel dynamic programming (Q6560205) (← links)
- Temporal reachability minimization: delaying vs. deleting (Q6564622) (← links)
- Synchronization in multilayer networks: when good links go bad (Q6564682) (← links)
- Scaling network topologies for multi-user entanglement distribution (Q6566169) (← links)
- Enhanced methods for the weight constrained shortest path problem (Q6566555) (← links)
- Directed shortest paths via approximate cost balancing (Q6567263) (← links)
- Speeding up the passenger assignment problem in transit planning by the direct link network representation (Q6568464) (← links)
- An associative version of the Prim-Dijkstra algorithm and its application to some graph problems (Q6570933) (← links)
- Optimal switching control of message transmission in computer networks (Q6574064) (← links)
- Recognition and isomorphism of proper \(H \)-graphs for unicyclic \(H\) in \textit{FPT}-time (Q6575404) (← links)
- Optimal output tracking of switched Boolean networks (Q6578797) (← links)
- A graph-based framework for complex system simulating and diagnosis with automatic reconfiguration (Q6581241) (← links)
- A guide to calculating habitat-quality metrics to inform conservation of highly mobile species (Q6582896) (← links)
- Multi-AGV route planning in automated warehouse system based on shortest-time Q-learning algorithm (Q6583299) (← links)
- Arc-dependent networks: theoretical insights and a computational study (Q6588520) (← links)
- Faster goal-oriented shortest path search for bulk and incremental detailed routing (Q6589742) (← links)
- Simple odd \(\beta \)-cycle inequalities for binary polynomial optimization (Q6589749) (← links)
- Algorithms for shortest path tour problem in large-scale road network (Q6591654) (← links)
- Uncertain multi-objective multi-route shortest path problem by robust enhanced non-dominated sorting genetic algorithms: application to emergency medical services (Q6593200) (← links)
- Routing on heavy path WSPD spanners (Q6600811) (← links)
- Heuristically ordered search in state graphs (Q6602248) (← links)
- Theoretical computer science: computational complexity (Q6602263) (← links)
- Improving contraction hierarchies by combining with all-pairs shortest paths problem algorithms (Q6606254) (← links)
- Flexible parametrization of graph-theoretical features from individual-specific networks for prediction (Q6615905) (← links)
- A time-dependent subgraph-capacity model for multiple shortest paths and application to \(\text{CO}_2\)/contrail-safe aircraft trajectories (Q6620756) (← links)
- String editing under pattern constraints (Q6646447) (← links)
- How to split a logic program (Q6647305) (← links)
- Optimal control of linear cost networks (Q6652240) (← links)
- On finding the community with maximum persistence probability (Q6655141) (← links)
- UAV path planning techniques: a survey (Q6658423) (← links)
