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

You might also read

Related Articles

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

Sort by
Same author

Machine learning dismantling and early-warning signals of disintegration in complex systems.

Nature communications·2021
Same author

Unfolding the Complexity of the Global Value Chain: Strength and Entropy in the Single-Layer, Multiplex, and Multi-Layer International Trade Networks.

Entropy (Basel, Switzerland)·2020
See all related articles

Related Experiment Video

Updated: Jul 5, 2025

Author Spotlight: Enhancement of Salient Object Detection for Smart Grid Applications
03:31

Author Spotlight: Enhancement of Salient Object Detection for Smart Grid Applications

Published on: December 15, 2023

556

Geometric Deep Learning sub-network extraction for Maximum Clique Enumeration.

Vincenza Carchiolo1, Marco Grassia1, Michele Malgeri1

  • 1Dipartimento Ingegneria Elettrica Elettronica Informatica Università di Catania, Catania, Italy.

Plos One
|January 16, 2024
PubMed
Summary

This study introduces LGP-MCE, a novel algorithm using Geometric Deep Learning to efficiently solve the Maximum Clique Enumeration problem. Experiments show LGP-MCE significantly speeds up computation while preserving all maximum cliques.

More Related Videos

Application of Deep Learning-Based Medical Image Segmentation via Orbital Computed Tomography
04:48

Application of Deep Learning-Based Medical Image Segmentation via Orbital Computed Tomography

Published on: November 30, 2022

2.8K
Deep Neural Networks for Image-Based Dietary Assessment
13:19

Deep Neural Networks for Image-Based Dietary Assessment

Published on: March 13, 2021

9.2K

Related Experiment Videos

Last Updated: Jul 5, 2025

Author Spotlight: Enhancement of Salient Object Detection for Smart Grid Applications
03:31

Author Spotlight: Enhancement of Salient Object Detection for Smart Grid Applications

Published on: December 15, 2023

556
Application of Deep Learning-Based Medical Image Segmentation via Orbital Computed Tomography
04:48

Application of Deep Learning-Based Medical Image Segmentation via Orbital Computed Tomography

Published on: November 30, 2022

2.8K
Deep Neural Networks for Image-Based Dietary Assessment
13:19

Deep Neural Networks for Image-Based Dietary Assessment

Published on: March 13, 2021

9.2K

Area of Science:

  • Graph Theory
  • Machine Learning
  • Computational Complexity

Background:

  • Maximum Clique Enumeration (MCE) is a critical NP-hard problem with diverse real-world applications.
  • Existing algorithms often struggle with scalability on large, complex networks.

Purpose of the Study:

  • To develop an efficient algorithm for Maximum Clique Enumeration.
  • To leverage Geometric Deep Learning for pruning large networks.

Main Methods:

  • Proposed LGP-MCE algorithm combining Geometric Deep Learning with exact methods.
  • Applied a node-filtering strategy based on Geometric Deep Learning.
  • Tested on a substantial dataset of real-world networks with varying characteristics.

Main Results:

  • LGP-MCE drastically reduces the running time for Maximum Clique Enumeration.
  • The algorithm successfully retains all maximum cliques.
  • Performance validated across networks of diverse sizes and densities.

Conclusions:

  • LGP-MCE offers a significant advancement in solving the Maximum Clique Enumeration problem.
  • Geometric Deep Learning provides an effective approach for network pruning in MCE.
  • The method demonstrates practical efficiency for real-world network analysis.