Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Phylogenetic Trees03:21

Phylogenetic Trees

48.2K
Phylogenetic trees come in many forms. It matters in which sequence the organisms are arranged from the bottom to the top of the tree, but the branches can rotate at their nodes without altering the information. The lines connecting individual nodes can be straight, angled, or even curved.
48.2K
Survival Tree01:19

Survival Tree

183
Survival trees are a non-parametric method used in survival analysis to model the relationship between a set of covariates and the time until an event of interest occurs, often referred to as the "time-to-event" or "survival time." This method is particularly useful when dealing with censored data, where the event has not occurred for some individuals by the end of the study period, or when the exact time of the event is unknown.
 Building a Survival Tree
Constructing a...
183
Manipulation and Analysis01:21

Manipulation and Analysis

107
GIS manipulation and analysis functions are vital for decision-making and planning. These activities range from data retrieval tasks, such as selecting information based on specific criteria, to advanced analytical techniques that address complex spatial problems.One critical GIS analysis method is overlaying, which combines multiple data layers to examine impacts. For example, overlaying a river-dammed lake boundary with road networks can identify affected infrastructure. Another common...
107
Short-distance Transport of Resources02:12

Short-distance Transport of Resources

16.7K
Short-distance transport refers to transport that occurs over a distance of just 2-3 cells, crossing the plasma membrane in the process. Small uncharged molecules, such as oxygen, carbon dioxide, and water, can diffuse across the plasma membrane on their own. In contrast, ions and larger molecules require the assistance of transport proteins due to their charge or size. Transport across membranes also occurs within individual cells, playing a variety of essential roles for the plant as a whole.
16.7K
Methods of Obtaining Topography01:25

Methods of Obtaining Topography

156
Topography involves measuring and mapping land elevations, natural features, and artificial structures to create accurate representations of the terrain. Topographic surveying relies on traditional and modern methods, each with distinct advantages and limitations.Traditional Surveying Methods:Transit stadia surveys and plane table surveys were widely used traditional surveying methods. These techniques relied on instruments like theodolites and stadia rods for measuring distances and angles,...
156
Design Example: Alignment of a Road Line Using GIS01:17

Design Example: Alignment of a Road Line Using GIS

136
The alignment of a road line using Geographic Information Systems (GIS) is a critical process in civil engineering, combining advanced technology with practical decision-making. This methodology begins with the collection of geospatial data, including information on land cover, geomorphology, drainage patterns, slope, and contour details. Such data is typically acquired through satellite imagery and GIS tools, offering a comprehensive understanding of the terrain.Once the data is gathered, it...
136

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

A Purely Algebraic Justification of the Kabsch-Umeyama Algorithm.

Journal of research of the National Institute of Standards and Technology·2021
Same author

An Examination of New Paradigms for Spline Approximations.

Journal of research of the National Institute of Standards and Technology·2016
Same author

Integer Representation of Decimal Numbers for Exact Computations.

Journal of research of the National Institute of Standards and Technology·2016
Same author

Optimization Models for Scheduling of Jobs.

Journal of research of the National Institute of Standards and Technology·2016
Same author

Evaluation of Aerodynamic Drag and Torque for External Tanks in Low Earth Orbit.

Journal of research of the National Institute of Standards and Technology·2016
Same journal

A Graph Coloring Algorithm for Large Scheduling Problems.

Journal of research of the National Bureau of Standards (1977)·2021
Same journal

Generators for Discrete Polynomial L<sub>1</sub> Approximation Problems.

Journal of research of the National Bureau of Standards (1977)·2021
Same journal

Room Temperature Poling of Poly(Vinylidene Fluoride) with Deposited Metal Electrodes.

Journal of research of the National Bureau of Standards (1977)·2021
Same journal

Molecular Dynamics Study of Liquid Rubidium and the Lennard-Jones Fluid.

Journal of research of the National Bureau of Standards (1977)·2021
Same journal

Isoionic Isotope Exchange with Hydroxylapatite and the Dilution Effect.

Journal of research of the National Bureau of Standards (1977)·2021
Same journal

Observations of Surface Changes in Platinum Crucibles.

Journal of research of the National Bureau of Standards (1977)·2021
See all related articles

Related Experiment Video

Updated: Oct 19, 2025

Foraging Path-length Protocol for Drosophila melanogaster Larvae
07:26

Foraging Path-length Protocol for Drosophila melanogaster Larvae

Published on: April 23, 2016

9.5K

Properties of Labeling Methods for Determining Shortest Path Trees.

Douglas R Shier1, Christoph Witzgall1

  • 1National Bureau of Standards, Washington, DC 20234.

Journal of Research of the National Bureau of Standards (1977)
|September 27, 2021
PubMed
Summary
This summary is machine-generated.

This study examines sequence lists used in network shortest path algorithms. We found that how these lists are managed determines if the algorithm correctly calculates distances, impacting computational efficiency.

Keywords:
05C0505C35Complexitylabelingnetworksequence listshortest pathtree

More Related Videos

Modeling the Functional Network for Spatial Navigation in the Human Brain
05:55

Modeling the Functional Network for Spatial Navigation in the Human Brain

Published on: October 13, 2023

1.2K
Combining Eye-tracking Data with an Analysis of Video Content from Free-viewing a Video of a Walk in an Urban Park Environment
08:25

Combining Eye-tracking Data with an Analysis of Video Content from Free-viewing a Video of a Walk in an Urban Park Environment

Published on: May 7, 2019

9.2K

Related Experiment Videos

Last Updated: Oct 19, 2025

Foraging Path-length Protocol for Drosophila melanogaster Larvae
07:26

Foraging Path-length Protocol for Drosophila melanogaster Larvae

Published on: April 23, 2016

9.5K
Modeling the Functional Network for Spatial Navigation in the Human Brain
05:55

Modeling the Functional Network for Spatial Navigation in the Human Brain

Published on: October 13, 2023

1.2K
Combining Eye-tracking Data with an Analysis of Video Content from Free-viewing a Video of a Walk in an Urban Park Environment
08:25

Combining Eye-tracking Data with an Analysis of Video Content from Free-viewing a Video of a Walk in an Urban Park Environment

Published on: May 7, 2019

9.2K

Area of Science:

  • Computer Science
  • Graph Theory
  • Algorithm Analysis

Background:

  • Shortest path algorithms are crucial in network analysis.
  • Sequence lists are commonly used to manage steps in labeling procedures.
  • Understanding the properties of these lists is essential for algorithm efficiency.

Purpose of the Study:

  • To formally analyze the properties of sequence lists in shortest path algorithms.
  • To investigate how different sequence list management strategies affect algorithm correctness.
  • To explore the relationship between these properties and computational complexity.

Main Methods:

  • Formal analysis of sequence list properties.
  • Investigation of labeling procedures for shortest paths.
  • Examination of 'branching out' property related to in-tree distances.

Main Results:

  • The 'branching out' property, ensuring correct in-tree distances, is dependent on the sequence list management method.
  • Certain management strategies guarantee this property, while others do not.
  • The study reveals a connection between this property and the computational complexity of labeling procedures.

Conclusions:

  • The choice of sequence list management significantly impacts the accuracy and efficiency of shortest path algorithms.
  • Further research into optimizing sequence list management is warranted for practical applications.
  • This work provides formal insights into the theoretical underpinnings of shortest path computation.