Pages that link to "Item:Q78129"
From MaRDI portal
The following pages link to A note on two problems in connexion with graphs (Q78129):
Displayed 50 items.
- roads (Q78130) (← links)
- cppRouting (Q81937) (← links)
- locationgamer (Q131991) (← links)
- Fuzzy quadratic minimum spanning tree problem (Q556109) (← links)
- Solving the shortest-paths problem on bipartite permutation graphs efficiently (Q672656) (← links)
- Approximately matching context-free languages (Q673469) (← links)
- Efficient parallel algorithms for computing all pair shortest paths in directed graphs (Q676269) (← links)
- Dynamic algorithms for shortest paths in planar graphs (Q685367) (← links)
- Linear-space best-first search (Q685539) (← links)
- Routing with nonlinear multiattribute cost functions (Q686201) (← links)
- Improving the location of minisum facilities through network modification (Q689226) (← links)
- Ear decomposition for pair comparison data (Q696936) (← links)
- Development of the tree-based link labeling algorithm for optimal path-finding in urban transportation networks (Q699346) (← links)
- Axiomatization of the Shapley value on minimum cost spanning tree games (Q700116) (← links)
- Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries (Q707138) (← links)
- Bounding probabilistic relationships in Bayesian networks using qualitative influences: methods and applications (Q707245) (← links)
- State-variable planning under structural restrictions: algorithms and complexity (Q1128767) (← links)
- An optimal design of piping route in a CAD system for power plant (Q1129476) (← links)
- Accessibility: A criterion for regularity and hierarchy in visual pattern codes (Q1176279) (← links)
- Efficient algorithms for divisive hierarchical clustering with the diameter criterion (Q1176597) (← links)
- Polynomial algorithms to finite Veber problem for a tree network (Q1176800) (← links)
- The space reduction method: A method to reduce the size of search spaces (Q1178225) (← links)
- Computing shortest paths in networks derived from recurrence relations (Q1179746) (← links)
- The multi-weighted Steiner tree problem (Q1179753) (← links)
- A fully polynomial time approximation scheme for minimum cost-reliability ratio problems (Q1183334) (← links)
- Shortest path and closure algorithms for banded matrices (Q1183497) (← links)
- Stability of an optimal schedule (Q1183618) (← links)
- On an instance of the inverse shortest paths problem (Q1184336) (← links)
- Shortest path algorithms: A computational study with the C programming language (Q1184466) (← links)
- A procedure to adjust transit trip departure times through minimizing the maximum headway (Q1186920) (← links)
- \(L_ 1\) shortest paths among polygonal obstacles in the plane (Q1188116) (← links)
- New scaling algorithms for the assignment and minimum mean cycle problems (Q1190599) (← links)
- The functional dimension of inductive definitions (Q1193414) (← links)
- A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems (Q1194853) (← links)
- A multicriteria Pareto-optimal path algorithm (Q1196025) (← links)
- Efficient parallel algorithms for shortest paths in planar digraphs (Q1196454) (← links)
- A graph-theoretic heuristic for designing loop-layout manufacturing systems (Q1197695) (← links)
- Locating concentrators in centralized computer networks (Q1197789) (← links)
- Planning for optimal expansion of leased line communication networks (Q1197800) (← links)
- An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem (Q1197938) (← links)
- Reasoning about qualitative temporal information (Q1204871) (← links)
- Network reduction for the acyclic constrained shortest path problem (Q1206607) (← links)
- The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm (Q1260623) (← links)
- Establishment of economic production rate, production batch size, and production sequence in manufacturing systems with flexible routing (Q1261323) (← links)
- An efficient algorithm for facility location in the presence of forbidden regions (Q1266516) (← links)
- \(K\)-tree/\(K\)-subgraph: A program package for minimal weighted \(K\)-cardinlity trees and subgraphs (Q1268220) (← links)
- An addendum to the hierarchical network design problem (Q1268252) (← links)
- Formal derivation of graph algorithmic programs using partition-and-recur (Q1273073) (← links)
- Shortest path algorithms for nearly acyclic directed graphs (Q1274325) (← links)
- Class Steiner trees and VLSI-design (Q1276969) (← links)