Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Distance Problem

Distance Problem

When an object's velocity changes over time, the total distance traveled can be determined by summing small displacement intervals over short increments. This approach approximates the true distance through numerical summation and the use of integral calculus. An estimate of the total displacement can be obtained by measuring velocity at regular intervals and multiplying each value by the corresponding time step.If a runner accelerates over the first three seconds of a race, speed measurements...

Interference: Path Lengths

Interference: Path Lengths

Consider two sources of sound, that may or may not be in phase, emitting waves at a single frequency, and consider the frequencies to be the same.
Two special sources may be considered when they are in phase. This can be easily achieved by feeding the two sources from the same source. An example would be synchronizing the two speakers by feeding them with the same source, such as the sound waves produced by a tuning fork. This setup ensures that the two sources have the same frequency and are...

Vector Algebra: Graphical Method

Vector Algebra: Graphical Method

Vectors can be multiplied by scalars, added to other vectors, or subtracted from other vectors. The vector sum of two (or more) vectors is called the resultant vector or, for short, the resultant.
We use the laws of geometry to construct resultant vectors, followed by trigonometry to find vector magnitudes and directions. For a geometric construction of the sum of two vectors in a plane, we follow the parallelogram rule. Suppose two vectors are at arbitrary positions. Translate either one of...

Maxam-Gilbert Sequencing

Maxam-Gilbert Sequencing

In the same year as the discovery of the Sanger sequencing method, another group of scientists, Allan Maxam and Walter Gilbert, demonstrated their chemical-cleavage method for DNA sequencing. The Maxam-Gilbert method relies on using different chemicals that can cleave the DNA sequence at specific sites, the separation of resulting DNA fragments of variable size using electrophoresis, and deciphering the DNA sequence from the resulting gel bands.
Challenges of the Maxam-Gilbert Method
The...

Graphs of Equations in Two Variables

Graphs of Equations in Two Variables

An equation with two variables, typically written in the form y = f(x) or Ax + By = C, describes a relationship between quantities represented by x and y. Each solution to such an equation is an ordered pair (x, y) that satisfies the equation when substituted. These pairs can be represented graphically to understand the variables' relationship visually.A common technique for constructing the graph of a two-variable equation is to create a value table. Begin by choosing several values for the...

The Distance Formula

The Distance Formula

In geometry, measuring the direct distance between two points on a plane is essential in various practical and theoretical applications. Whether in navigation, engineering, or computer graphics, determining the shortest path between two locations involves using the distance formula. This formula is derived from the Pythagorean Theorem, which relates the lengths of the sides of a right triangle. On a coordinate plane, the horizontal and vertical distances between two points serve as the legs of...

You might also read

Related Articles

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

Sort by

Same author

CRSwNP in the biologics era: evaluating patient-reported quality of life outcomes.

Frontiers in allergy·2026

Same author

Age-stratified associations of glycemia, blood pressure, and cholesterol with mortality in diabetes: A prospective cohort study.

BMC medicine·2026

Same author

Predictive value of thyroid autoantibodies for coronary heart disease severity in individuals with normal thyroid function based on machine learning and SHAP interpretation.

Frontiers in immunology·2026

Same author

Age-specific effects of hemoglobin A1c, blood pressure, and cholesterol levels on incident cardiovascular diseases among adults with diabetes in China: a 10-year prospective cohort study.

Life metabolism·2026

Same author

Mechanism of AGEs-RAGE axis inhibition of ferroptosis in type 2 diabetic colon cancer by regulatory CEACAM1.

Scientific reports·2026

Same author

Investigating the Role of TNFSF12 in Thyroid Cancer Progression via Single-Cell RNA Sequencing and Integrated Multiomics Analyses.

Mediators of inflammation·2026

Search research articles

Related Experiment Videos

An Extended Path Following Algorithm for Graph-Matching Problem.

Zhi-Yong Liu¹, Hong Qiao, Lei Xu

¹State Key Laboratory of Management and Control for Complex Systems, Institute of Automation, Chinese Academy of Sciences, Beijing 100190, China. zhiyong.liu@ia.ac.cn

IEEE Transactions on Pattern Analysis and Machine Intelligence

|February 15, 2012

Summary

Researchers extended the path following algorithm for graph matching. This new method enhances accuracy for directed graph matching problems, showing strong performance in experiments.

Related Experiment Videos

Area of Science:

Graph theory
Optimization algorithms
Computer science

Background:

The path following algorithm has shown state-of-the-art performance for matching problems on undirected graphs.
Extending graph matching algorithms to directed graphs remains a significant challenge.

Purpose of the Study:

To extend the path following algorithm to solve matching problems on directed graph models.
To introduce a novel concave relaxation technique for directed graph matching.

Main Methods:

A concave relaxation of the directed graph matching problem was proposed.
Objective functions were constructed based on concave and convex relaxations.
The Frank-Wolfe algorithm was employed for optimization.

Main Results:

The extended path following algorithm demonstrated validity on synthetic datasets.
Experimental results on real-world data confirmed the algorithm's effectiveness.
The approach achieved high matching accuracy on directed graph models.

Conclusions:

The extended path following algorithm is a viable and effective method for directed graph matching.
The proposed concave relaxation technique successfully addresses the complexities of directed graph matching.
This work advances the application of path following algorithms in graph theory and optimization.