Skip to content
Descubridor Institucional UMAR
Inicio
Búsqueda avanzada
Explorar
Inicio
Búsqueda avanzada
Explorar
Login
Language
English
Deutsch
Español
Français
Italiano
All Fields
Title
Author
Subject
Call Number
ISBN/ISSN
Tag
Find
Advanced
Speeding‐Up Graph Algorithms via Clique Partitioning
Speeding‐Up Graph Algorithms via Clique Partitioning
Fuente:
Wiley Open Access
Saved in:
Bibliographic Details
Main Authors:
Akshar Chavan
,
Sanaz Rabinia
,
Daniel Grosu
,
Marco Brocanelli
Format:
Artículo Open Access
Published:
Wiley
2026
Subjects:
Networks
Online Access:
Acceder al recurso
Tags:
Add Tag
No Tags, Be the first to tag this record!
Cite this
Text this
Email this
Print
Export Record
Export to RefWorks
Export to EndNoteWeb
Export to EndNote
Save to List
Permanent link
Holdings
Description
Comments
Similar Items
Staff View
Description
DOI:
10.1002/net.70038
Similar Items
Speeding-up Graph Algorithms via Clique Partitioning
by: Chavan, Akshar, et al.
Published: (2025)
Rethinking Energy Management for Autonomous Ground Robots on a Budget
by: Chavan, Akshar, et al.
Published: (2025)
High-Modularity Graph Partitioning Through NLP Techniques and Maximal Clique Enumeration
by: D'Elia, Marco, et al.
Published: (2026)
An Efficient Loop and Clique Coarsening Algorithm for Graph Classification
by: Qi, Xiaorui, et al.
Published: (2024)
Machine Learning on Dynamic Graphs: A Survey on Applications
by: Fard, Sanaz Hasanzadeh
Published: (2024)