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 Experiment Videos

A (sub)graph isomorphism algorithm for matching large graphs.

Luigi P Cordella1, Pasquale Foggia, Carlo Sansone

  • 1Dipartimento di Informatica e Sistemistica, Universitá di Napoli Federico II Via Claudio 21, I-80125 Napoli, Italy. cordel@unina.it

IEEE Transactions on Pattern Analysis and Machine Intelligence
|January 12, 2005
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

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

Sort by
Same author

A dedicated deep learning workflow for automatic Fasciola hepatica and Calicophoron daubneyi egg detection using the Kubic FLOTAC microscope.

International journal for parasitology·2025
Same author

Context-aware data augmentation for enhanced speech command recognition in industrial environments.

Scientific reports·2025
Same author

An Experimental Evaluation of Smart Sensors for Pedestrian Attribute Recognition Using Multi-Task Learning and Vision Language Models.

Sensors (Basel, Switzerland)·2025
Same author

A Multi-task learning U-Net model for end-to-end HEp-2 cell image analysis.

Artificial intelligence in medicine·2024
Same author

Automating parasite egg detection: insights from the first AI-KFM challenge.

Frontiers in artificial intelligence·2024
Same author

A Physiological-Informed Generative Model for Improving Breast Lesion Classification in Small DCE-MRI Datasets.

IEEE journal of biomedical and health informatics·2024
Same journal

Relation DETR+: Exploring Explicit Position Relation Prior for Dense Prediction.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

RBF++: Quantifying and Optimizing Reasoning Boundaries across Measurable and Unmeasurable Capabilities for Chain-of-Thought Reasoning.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

CAFE: Cross-View Adaptive Fusion and Cluster Center Enhancement for Robust Multi-View Clustering.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

DIVER: Reinforced Diffusion Breaks Imitation Bottlenecks in End-to-End Autonomous Driving.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

Ethics-Aware Safe Reinforcement Learning for Rare-Event Risk Control in Interactive Urban Driving.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

Learning Shape Anchors for Holistic Indoor Scene Understanding.

IEEE transactions on pattern analysis and machine intelligence·2026
See all related articles

This study introduces an improved graph isomorphism algorithm designed for large-scale graphs. The enhanced algorithm reduces complexity and boosts performance, proving effective in real-world applications.

Area of Science:

  • Computer Science
  • Graph Theory
  • Algorithm Design

Background:

  • Graph isomorphism and subgraph isomorphism are fundamental problems in computer science.
  • Previous algorithms have shown limitations when applied to large graphs.
  • Efficiently handling large graph datasets is crucial for various applications.

Purpose of the Study:

  • To present an improved algorithm for graph and subgraph isomorphism tailored for large graphs.
  • To reduce the spatial complexity and enhance the performance of the existing algorithm.
  • To provide a detailed analysis of the algorithm's time and memory requirements.

Main Methods:

  • An enhanced algorithm for graph isomorphism and subgraph isomorphism was developed.
  • Spatial complexity was reduced, and performance on large graphs was improved.

Related Experiment Videos

  • The algorithm's time and memory efficiency were analyzed in detail.

    • Main Results:

    • The improved algorithm demonstrates enhanced performance on large graphs.
    • Testing on synthetic and real-world datasets (technical drawings) confirmed effectiveness.
    • Reduced spatial complexity was achieved without compromising accuracy.

    Conclusions:

    • The enhanced algorithm is highly effective for large graph isomorphism and subgraph isomorphism tasks.
    • The improvements make the algorithm suitable for computationally intensive applications.
    • Further validation on diverse large-scale graph datasets is recommended.