A note on two problems in connexion with graphs
From MaRDI portal
(Redirected from Publication:78129)
Cites work
Cited in
(only showing first 100 items - show all)- Input-output networks offer new insights of economic structure
- Hollow Heaps
- Developing Topology Discovery in Event-B
- A further anticycling rule in multichain policy iteration for undiscounted Markov renewal programs
- Fast query structures in anisotropic media
- Sharing information for the all pairs shortest path problem
- A novel method for planning a staged evacuation
- Three-objective subgraph mining using multiobjective evolutionary programming
- Locating concentrators in centralized computer networks
- Reducing the hierarchical network design problem
- Models and linearizations for the Traveling Car Renter with passengers
- Least-violating control strategy synthesis with safety rules
- An external memory data structure for shortest path queries
- Spanning trees and shortest paths in Monge graphs
- DEA‐based centralized resource allocation with network flows
- The influence of maximum \((s,t)\)-cuts on the competitiveness of deterministic strategies for the Canadian traveller problem
- Disjoint paths in a network
- From affiliation matrices to adjacency matrices: methods and techniques for the analysis of centrality
- On the Exact Solution of Prize-Collecting Steiner Tree Problems
- Heuristic search for one-to-many shortest path queries
- Optimization of the distribution and localization of wireless sensor networks based on differential evolution approach
- ON SOLVING SHORTEST PATHS WITH A LEAST-SQUARES PRIMAL-DUAL ALGORITHM
- Learning nonlinear hybrid systems: from sparse optimization to support vector regression
- New presentations of a link and virtual link
- Compact formulations of the Steiner traveling salesman problem and related problems
- Parameterized complexity of conflict-free matchings and paths
- An addendum to the hierarchical network design problem
- A computational model for spatial cognition combining dorsal and ventral hippocampal place field maps: multiscale navigation
- Flowpipe approximation and clustering in space-time
- A walk over the shortest path: Dijkstra's algorithm viewed as fixed-point computation.
- Congestion network problems and related games
- Shortest path between two simple polygons
- Random field simulation over curved surfaces: applications to computational structural mechanics
- An ordered upwind method with precomputed stencil and monotone node acceptance for solving static convex Hamilton-Jacobi equations
- Observer design for a class of piecewise affine hybrid systems
- Tracking differentiable trajectories across polyhedra boundaries
- Terminal-pair reliability in ATM virtual path networks
- GNet: a generalized network model and its applications in qualitative spatial reasoning
- On decay centrality
- SecGDB: graph encryption for exact shortest distance queries with efficient updates
- A computational study of efficient shortest path algorithms
- On the second point-to-point undirected shortest simple path problem
- Netscan: a procedure for generating reaction networks by size
- Algorithms to test open set condition for self-similar set related to P.V. numbers
- Hyperspherical embedding of graphs and networks in communicability spaces
- BIOLOGICAL SYSTEMS ANALYSIS BY A NETWORK PROTEOMICS APPROACH AND SUBCELLULAR PROTEIN PROFILING
- A new tangentially stabilized 3D curve evolution algorithm and its application in virtual colonoscopy
- Corner cases, singularities, and dynamic factoring
- Using link analysis technique with a modified shortest-path algorithm to fight money laundering
- Decomposition of probability marginals for security games in abstract networks
- Heuristically guided search and chromosome matching
- A variational inequality formulation of the dynamic traffic assignment problem
- A generalized approximation framework for fractional network flow and packing problems
- Path Laplacian matrices: introduction and application to the analysis of consensus in networks
- K\(^{\ast}\): A heuristic search algorithm for finding the \(k\) shortest paths
- Structural Change and Homeostasis in Organizations: A Decision-Theoretic Approach
- Dynamic algorithms for shortest paths in planar graphs
- Routing with nonlinear multiattribute cost functions
- Improving the location of minisum facilities through network modification
- The minimum weight \(t\)-composition of an integer
- Identifying systemically important financial institutions: a network approach
- Shortest path algorithms: A computational study with the C programming language
- A biobjective Dijkstra algorithm
- A multiple objective transportation problem approach to dynamic truck dispatching in surface mines
- A survey of geodesic paths on 3D surfaces
- An improved iterative reconstruction algorithm for traveltime tomography
- Shortest paths in stochastic networks with correlated link costs
- Efficient computation of Lyapunov functions for Morse decompositions
- The \(k\)-cardinality assignment problem
- Generalized zeon algebras: theory and application to multi-constrained path problems
- Fast algorithms for the undirected negative cost cycle detection problem
- On the shortest path problem with negative cost cycles
- The \(k\)-distinct language: parameterized automata constructions
- A new novel local search integer-programming-based heuristic for PCB assembly on collect-and-place machines
- Large-scale optimization with the primal-dual column generation method
- Limited-information control of hybrid systems via reachable set propagation
- A language for generic programming in the large
- The first open channel for yield-stress fluids in porous media
- Symbolic approximate time-optimal control
- A planning language for embedded systems
- Diversification strategies in local search for a nonbifurcated network loading problem
- Algorithms for the minmax regret path problem with interval data
- Computation of the center and diameter of outerplanar graphs
- A comprehensive reachability evaluation for airline networks with multi-constraints
- Optimising material handling costs in an assembly workshop
- Trip-based path algorithms using the transit network hierarchy
- A two-phase shortest path algorithm for networks with node coordinates
- Path planning versus cue responding: a bio-inspired model of switching between navigation strategies
- Modeling Dynamic Vehicle Navigation in a Self-Organizing, Peer-to-Peer, Distributed Traffic Information System
- Long and short paths in uniform random recursive dags
- Hermitian normalized Laplacian matrix for directed networks
- Leader nodes in communities for information spreading
- Functional correctness of C implementations of Dijkstra's, Kruskal's, and Prim's algorithms
- Unsupervised representation learning with minimax distance measures
- On the spanning and routing ratios of the directed _6-graph
- Routing on heavy-path WSPD-spanners
- OAR lib: an open source arc routing library
- Ordered line integral methods for solving the eikonal equation
- An adaptive memory programming method for risk logistics operations
- Breadth-first heuristic search
This page was built for publication: A note on two problems in connexion with graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q78129)
