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

Vector Algebra: Graphical Method01:10

Vector Algebra: Graphical Method

12.2K
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...
12.2K
Thevinin's Theorem01:15

Thevinin's Theorem

581
Thévenin's theorem plays a pivotal role in electrical circuit analysis, offering a solution to the challenges posed by variable loads within a circuit. In practical applications, it is common to encounter circuits where certain elements remain fixed while others fluctuate, often referred to as the "load." A typical household electrical outlet serves as a prime example of a variable load, as it can be connected to a variety of appliances, each with its own unique electrical...
581
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

72
Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
72
Castigliano's Theorem: Problem Solving01:14

Castigliano's Theorem: Problem Solving

675
The deflection of a simply supported beam that carries a central point load can be analyzed using structural mechanics principles, particularly by applying Castigliano's theorem. This theorem relates the displacement at the load application point to the partial derivatives of the strain energy in the structure. The simply supported beam with a point load at its center has symmetric reaction forces at the supports, each bearing half of the load. The bending moment at any point along the beam...
675
Theorems of Pappus and Guldinus: Problem Solving01:12

Theorems of Pappus and Guldinus: Problem Solving

758
Pappus and Guldinus's theorems are powerful mathematical principles that are used for finding the surface area and volume of composite shapes. For example, consider a cylindrical storage tank with a conical top. Finding the surface area or volume can be challenging for such complex shapes. These theorems are particularly useful in calculating the volume and surface area of such systems. Here, the cylindrical storage tank with a conical top can be broken down into two simple shapes: a...
758
Statically Indeterminate Problem Solving01:16

Statically Indeterminate Problem Solving

442
Statically indeterminate problems are those where statics alone can not determine the internal forces or reactions. Consider a structure comprising two cylindrical rods made of steel and brass. These rods are joined at point B and restrained by rigid supports at points A and C. Now, the reactions at points A and C and the deflection at point B are to be determined. This rod structure is classified as statically indeterminate as the structure has more supports than are necessary for maintaining...
442

You might also read

Related Articles

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

Sort by
Same author

Multiscale insights into thrombus growth and detachment under non-physiological blood flow.

Computer methods and programs in biomedicine·2026
Same author

Hyaluronic acid-based reactive oxygen species responsive nanocomposite hydrogel for sequential drug delivery and effective prevention of postoperative abdominal adhesions.

Carbohydrate polymers·2026
Same author

Exciton transfer dynamics between graphene quantum dots and MXene explored by transient absorption spectroscopy and its application.

Spectrochimica acta. Part A, Molecular and biomolecular spectroscopy·2025
Same author

Single quantum dot standard for confocal detection efficiency.

Optics express·2025
Same author

Unidirectional Raman emission of Stokes photons from a circularly polarized transition of atoms in a chiral ring cavity.

Optics express·2025
Same author

Corrigendum to 'Oxidized fucoidan-based nanocomposite hydrogel for cryptotanshinone delivery and prevention of postoperative abdominal adhesions' [Journal of Controlled Release 382 (2025) 113733].

Journal of controlled release : official journal of the Controlled Release Society·2025

Related Experiment Video

Updated: Jul 15, 2025

ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data
05:12

ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data

Published on: January 16, 2019

11.5K

TIVC: An Efficient Local Search Algorithm for Minimum Vertex Cover in Large Graphs.

Yu Zhang1, Shengzhi Wang2, Chanjuan Liu3

  • 1Cyberspace Institute of Advanced Technology, Guangzhou University, Guangzhou 510006, China.

Sensors (Basel, Switzerland)
|September 28, 2023
PubMed
Summary
This summary is machine-generated.

The TIVC algorithm efficiently solves the Minimum Vertex Cover (MVC) problem, an NP-hard task crucial for cybersecurity and network analysis. It finds smaller vertex covers on large graphs than existing methods.

Keywords:
combinatorial optimizationlarge graphslocal searchminimum vertex cover (MVC)wireless sensor networks (WSNs)

More Related Videos

Detection and Quantification of Tunneling Nanotubes Using 3D Volume View Images
12:45

Detection and Quantification of Tunneling Nanotubes Using 3D Volume View Images

Published on: August 31, 2022

2.9K
Inherent Dynamics Visualizer, an Interactive Application for Evaluating and Visualizing Outputs from a Gene Regulatory Network Inference Pipeline
10:44

Inherent Dynamics Visualizer, an Interactive Application for Evaluating and Visualizing Outputs from a Gene Regulatory Network Inference Pipeline

Published on: December 7, 2021

2.2K

Related Experiment Videos

Last Updated: Jul 15, 2025

ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data
05:12

ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data

Published on: January 16, 2019

11.5K
Detection and Quantification of Tunneling Nanotubes Using 3D Volume View Images
12:45

Detection and Quantification of Tunneling Nanotubes Using 3D Volume View Images

Published on: August 31, 2022

2.9K
Inherent Dynamics Visualizer, an Interactive Application for Evaluating and Visualizing Outputs from a Gene Regulatory Network Inference Pipeline
10:44

Inherent Dynamics Visualizer, an Interactive Application for Evaluating and Visualizing Outputs from a Gene Regulatory Network Inference Pipeline

Published on: December 7, 2021

2.2K

Area of Science:

  • Computer Science
  • Optimization Theory

Background:

  • The Minimum Vertex Cover (MVC) problem is a fundamental NP-hard combinatorial optimization challenge.
  • MVC has critical applications in cybersecurity, scheduling, and wireless sensor network (WSN) link failure monitoring.
  • Existing local search algorithms struggle to efficiently solve MVC on large-scale graphs.

Purpose of the Study:

  • To propose an efficient local search algorithm for the Minimum Vertex Cover problem.
  • To address the computational challenges of solving MVC on large graphs.

Main Methods:

  • Introduced TIVC, a novel local search algorithm for MVC.
  • TIVC utilizes a 3-improvements (TI) framework with a tiny perturbation and an edge selection strategy.
  • Algorithm performance was evaluated on real-world large graph instances.

Main Results:

  • TIVC demonstrated superior performance compared to three state-of-the-art MVC algorithms.
  • The algorithm achieved higher accuracy in finding vertex covers.
  • TIVC significantly identified smaller vertex covers on numerous large graphs.

Conclusions:

  • TIVC offers an efficient and effective solution for the Minimum Vertex Cover problem, particularly on large instances.
  • The proposed method advances the state-of-the-art in solving NP-hard combinatorial optimization problems.
  • TIVC's ability to find smaller vertex covers has significant implications for its application domains.