A note on two problems in connexion with graphs
Explore this paper's citation graph
Summary
A tree is a graph with one and only one path between every two nodes, where at least one path exists between any two nodes and the length of each branch is given.
- Type
- article
- Published
- 1959-12-01
- Cited by
- 27,037
- References
- 5
- OpenAlex
- https://openalex.org/W2169528473
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:123284777
Keywords
Mathematics, Numerical analysis, Calculus (dental), Mathematical analysis
References
Cited by
- Scalable QoS routing in MPLS networks using mobile code
- Ambulance routing problems with rich constraints and multiple objectives
- An agent-based vehicle routing simulation tool for road networks with time-variant data
- Intégration de l'impact environnemental, sociétal et économique du transport intermodal au sein des chaînes logistiques vertes : optimisation multiobjectif par les colonies de fourmis
- Parallel algorithms for the single source shortest path problem
- Applications of Uncertainty Theory to Rock Mechanics and Geotechnical Mine Design
- A discrete simulation model for heterogeneous traffic including bicycles on urban road networks
- Ferramentas para descobrir o melhor caminho
- A Review of Optimization Methods
- A Guide to Heuristic-based Path Planning
- Modélisation d'un agent autonome: approche constructiviste de l'architecture de contrôle et de la représentation des connaissances
- Fast Marching and Fast Driving: Combining Off-Line Search and Reactive AI
- Graph Collapsing in Shortest Path Auction Algorithms
- Software for constructing and verifying pedigrees within large genealogies and an application to the Old Order Amish of Lancaster County.
- Performance Evaluation of Tools and Techniques for Representing Cost-Based Decision Criteria for On-Road Autonomous Navigation
- Tracing of thin tubular structures in computer tomographic data.
- PAC: Progressive Alignment with Consensus Sequences
- Optimal Sensor Requirements
- An augmenting path method for solving Linear Bottleneck Assignment problems
- Automated Generation of Geometrically-Precise and Semantically-Informed Virtual Geographic Environments Populated with Spatially-Reasoning Agents
Related papers
- Primärzerlegung in Steinschen Algebren
- Über unirationale Scharen auf algebraischen Mannigfaltigkeiten
- On the Generalized Second Limit-Theorem in the Calculus of Probabilities
- On the generalized second limit-theorem in the calculus of probabilities.
- An iterative numerical method for fractional integral equations of the second kind
- Numerical evaluation for Cauchy type singular integrals on the interval
- A Shishkin mesh for a singularly perturbed Riccati equation
- Instantaneous rate of change: a numerical approach
- Some numerical methods for the study of the convexity notions arising in the calculus of variations
- Convolution quadrature and discretized operational calculus. I