Pages that link to "Item:Q78129"

The following pages link to A note on two problems in connexion with graphs (Q78129):

Displaying 50 items.

• Balancing minimum spanning trees and shortest-path trees (Q1899219) (← links)
• An efficient parallel algorithm for shortest paths in planar layered digraphs (Q1899220) (← links)
• A mathematical model to evaluate a CAI courseware (Q1900295) (← links)
• Minimum spanning trees for tree metrics: Abridgements and adjustments (Q1907943) (← links)
• A computer assistant for vehicle dispatching with learning capabilities (Q1908304) (← links)
• Searching among intervals and compact routing tables (Q1913700) (← links)
• Computation of shortest path in cellular automata (Q1914940) (← links)
• On some multicriteria arborescence problems: Complexity and algorithms (Q1917271) (← links)
• Shortest shortest path trees of a network (Q1917275) (← links)
• Optimal representation of the minimum spanning tree algorithm in associative parallel processors (Q1918755) (← links)
• Algorithms for dense graphs and networks on the random access computer (Q1918989) (← links)
• Shortest paths algorithms: Theory and experimental evaluation (Q1919099) (← links)
• Multiobjective routing problems (Q1919112) (← links)
• The network synthesis problem in a cycle (Q1924616) (← links)
• Homological spanning forest framework for 2D image analysis (Q1926586) (← links)
• A capacitated network flow optimization approach for short notice evacuation planning (Q1927009) (← links)
• The weak-heap data structure: variants and applications (Q1932363) (← links)
• Sparsity driven people localization with a heterogeneous network of cameras (Q1932873) (← links)
• Bounding the number of points on a curve using a generalization of Weierstrass semigroups (Q1934228) (← links)
• Biased random-key genetic algorithms with applications in telecommunications (Q1935883) (← links)
• A branch and price algorithm for the minimum power multicasting problem in wireless sensor networks (Q1935910) (← links)
• Dijkstra, Floyd and Warshall meet Kleene (Q1941863) (← links)
• A shortest cycle for each vertex of a graph (Q1944201) (← links)
• Air cargo scheduling: integrated models and solution procedures (Q1944877) (← links)
• Does Euclidean distance work well when the \(p\)-median model is applied in rural areas? (Q1945072) (← links)
• Implementation aspects of list sphere decoder algorithms for MIMO-OFDM systems (Q1957283) (← links)
• Computing the greedy spanner in near-quadratic time (Q1957650) (← links)
• Hybrid co-evolutionary particle swarm optimization and noising metaheuristics for the delay constrained least cost path problem (Q1959183) (← links)
• Optimal computation of shortest paths on doubly convex bipartite graphs (Q1963107) (← links)
• Synchronization paradigm for protocol testing under multiparty configuration (Q1963369) (← links)
• A new scaling algorithm for the minimum cost network flow problem (Q1970413) (← links)
• Quantile filtering of colour images via symmetric matrices (Q1980872) (← links)
• A smaller extended formulation for the odd cycle inequalities of the stable set polytope (Q1983107) (← links)
• Random field simulation over curved surfaces: applications to computational structural mechanics (Q1986783) (← links)
• Planning and navigation as active inference (Q1990619) (← links)
• A column generation approach for location-routing problems with pickup and delivery (Q1991113) (← links)
• Location of facility based on simulated annealing and ``ZKW'' algorithms (Q1992773) (← links)
• Models and linearizations for the Traveling Car Renter with passengers (Q1996740) (← links)
• Subnetwork origin-destination matrix estimation under travel demand constraints (Q2005896) (← links)
• Hybrid fast sweeping methods for anisotropic eikonal equation in two-dimensional tilted transversely isotropic media (Q2007014) (← links)
• A phenomenological operator description of dynamics of crowds: escape strategies (Q2009739) (← links)
• Unstructured grid adaptation for multiscale finite volume method (Q2009871) (← links)
• Robustness of dengue complex network under targeted versus random attack (Q2012763) (← links)
• Moment-based angular difference estimation between two tomographic projections in 2D and 3D (Q2014477) (← links)
• Potential-based bounded-cost search and anytime non-parametric A* (Q2014923) (← links)
• Faster algorithm to find anti-risk path between two nodes of an undirected graph (Q2015812) (← links)
• Valid inequalities and lifting procedures for the shortest path problem in digraphs with negative cycles (Q2017836) (← links)
• Shared-memory block-based fast marching method for hierarchical meshes (Q2020521) (← links)
• A spectral approach to the shortest path problem (Q2020688) (← links)
• Deep generative modeling for mechanistic-based learning and design of metamaterial systems (Q2020976) (← links)