A note on two problems in connexion with graphs
From MaRDI portal
Cites work
Cited in
(only showing first 100 items - show all)- Fast image inpainting based on coherence transport
- A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem
- Finding the anti-block vital edge of a shortest path between two nodes
- Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem
- ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems
- Approximate labelled subtree homeomorphism
- Finding non-dominated bicriteria shortest pairs of disjoint simple paths
- An \(O(n^{5/2}\log n)\) algorithm for the rectilinear minimum link-distance problem in three dimensions
- Asymmetric distances, semidirected networks and majority in Fermat-Weber problems
- Efficient reconstruction of metabolic pathways by bidirectional chemical search
- A new bidirectional search algorithm with shortened postprocessing
- An extension of labeling techniques for finding shortest path trees
- Combinatorial optimization in system configuration design
- Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation
- Topology representing networks for the visualization of manifolds
- On the \(K\) shortest path trees problem
- Flows with unit path capacities and related packing and covering problems
- A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing
- On the system optimum of traffic assignment in \(M/G/c/c\) state-dependent queueing networks
- Developing topology discovery in Event-B
- An O(m log log D) algorithm for shortest paths
- Finding shortest paths in the plane in the presence of barriers to travel (for any \(l_ p\)-norm)
- Network flows with age dependent decay rates
- An extension of set partitioning with application to scheduling problems
- Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
- The fleet size and mix problem for capacitated arc routing
- The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm
- Microcomputer-based algorithms for large scale shortest path problems
- An improvement of Dijkstra's method for finding a shortest path in a graph
- An introduction to parallelism in combinatorial optimization
- Scaling algorithms for network problems
- An algorithm for shortest-path motion in three dimensions
- A shortest-route approach for optimum aggregation of data with an application to income data
- A shortest augmenting path algorithm for dense and sparse linear assignment problems
- Optimal paths in probabilistic networks: A case with temporary preferences
- The shortest-path problem for graphs with random arc-lengths
- Edge exchanges in the degree-constrained minimum spanning tree problem
- Shortest paths in Euclidean graphs
- Algorithms for finding k-best perfect matchings
- The telephonic switching centre network problem: Formalization and computational experience
- Experiments with parallel algorithms for combinatorial problems
- Optimal piecewise linear motion of an object among obstacles
- A new approach for crew pairing problems by column generation with an application to air transportation
- Scheduling jobs with fixed start and end times
- An \(O(ND)\) difference algorithm and its variations
- Minimum deviation problems
- On the use of ordered sets in problems of comparison and consensus of classifications
- Shortest path between two simple polygons
- Rectilinear shortest paths in the presence of rectangular barriers
- A parallel shortest path algorithm
- A computational study of efficient shortest path algorithms
- An algorithmic approach to some problems in terrain navigation
- An edge elimination test for the Steiner problem in graphs
- An approximation algorithm for the TSP
- Polyhedra of regular p-nary group problems
- Reducing the hierarchical network design problem
- State-variable planning under structural restrictions: algorithms and complexity
- An optimal design of piping route in a CAD system for power plant
- Depth-first K-trees and critical path analysis
- Computation of the center and diameter of outerplanar graphs
- An O(m log D) algorithm for shortest paths
- A fast algorithm for Steiner trees
- Complexity of spanning tree problems: Part I
- Finding minimal spanning trees in a Euclidean coordinate space
- A new algorithm to find the shortest paths between all pairs of nodes
- A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
- On the connectivity of a network
- Parallel algorithms for the single source shortest path problem
- A bicriterion shortest path algorithm
- Minimal spanning trees and partial sorting
- Maximum flow in a network with fuzzy arc capacities
- The ellipsoid method and its consequences in combinatorial optimization
- The symmetric traveling salesman problem and edge exchanges in minimal 1- trees
- The application of discrete programming to the design of delivery systems in large agglomerations
- A new algorithm for finding the shortest path between a specified pair of nodes in a graph of nonnegative arcs
- An algorithm to evaluate public transportation stops for minimizing passenger walking distance
- Accessibility: A criterion for regularity and hierarchy in visual pattern codes
- Efficient algorithms for divisive hierarchical clustering with the diameter criterion
- Polynomial algorithms to finite Veber problem for a tree network
- The space reduction method: A method to reduce the size of search spaces
- Computing shortest paths in networks derived from recurrence relations
- The multi-weighted Steiner tree problem
- A fully polynomial time approximation scheme for minimum cost-reliability ratio problems
- Shortest path and closure algorithms for banded matrices
- Stability of an optimal schedule
- On an instance of the inverse shortest paths problem
- Shortest path algorithms: A computational study with the C programming language
- A procedure to adjust transit trip departure times through minimizing the maximum headway
- \(L_ 1\) shortest paths among polygonal obstacles in the plane
- New scaling algorithms for the assignment and minimum mean cycle problems
- The functional dimension of inductive definitions
- A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems
- A multicriteria Pareto-optimal path algorithm
- Efficient parallel algorithms for shortest paths in planar digraphs
- A graph-theoretic heuristic for designing loop-layout manufacturing systems
- Locating concentrators in centralized computer networks
- Planning for optimal expansion of leased line communication networks
- An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem
- Reasoning about qualitative temporal information
- Network reduction for the acyclic constrained shortest path problem
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)
