Cover Image

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!

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)

Multi-domain Network Slice Partitioning: A Graph Neural Network Algorithm
by: Wu, Zhouxiang, et al.
Published: (2024)

Temporal Link Prediction Using Graph Embedding Dynamics
by: Fard, Sanaz Hasanzadeh, et al.
Published: (2024)

Speeding Up the Solution of the Site and Power Assignment Problem in Wireless Networks
by: Pasquale Avella, et al.
Published: (2025)

Sparse Partitions of Graphs with Bounded Clique Number
by: Girão, António, et al.
Published: (2024)

The Minimum Clique Routing Problem on Cycles
by: M. Escalante, et al.
Published: (2025)

Clique counts for network similarity
by: Bonato, Anthony, et al.
Published: (2024)

Noisy Quantum Trees: Infinite Protection Without Correction
by: Yadavalli, Shiv Akshar, et al.
Published: (2023)

Neural Acceleration for Graph Partitioning
by: Booth, Joshua Dennis, et al.
Published: (2026)

Parallel Unconstrained Local Search for Partitioning Irregular Graphs
by: Maas, Nikolai, et al.
Published: (2023)

Maximum Degree-Based Quasi-Clique Search via an Iterative Framework
by: Xia, Hongbo, et al.
Published: (2025)

An Implicit Enumeration Approach for Maximum Ratio Clique Relaxations
by: Yehor Blokhin, et al.
Published: (2025)

Towards Faster Graph Partitioning via Pre-training and Inductive Inference
by: Qin, Meng, et al.
Published: (2024)

InfraredGP: Efficient Graph Partitioning via Spectral Graph Neural Networks with Negative Corrections
by: Qin, Meng, et al.
Published: (2025)

Efficient Computation of Maximum Flexi-Clique in Networks
by: Kim, Song, et al.
Published: (2026)

Citation Cliques in Low Impact Journals
by: Spanakis, Panagiotis-Alexios, et al.
Published: (2026)

A educação como experiência a partir de histórias lidas econtadas: momentos de (re)criação da infância
by: Cláudio Roberto Brocanelli
Published: (2013)

Node Classification via Simplicial Interaction with Augmented Maximal Clique Selection
by: Koo, Eunho, et al.
Published: (2025)

Dismountability in Temporal Cliques Revisited
by: Carnevale, Daniele, et al.
Published: (2025)

Maximum Edge-based Quasi-Clique: Novel Iterative Frameworks
by: Xia, Hongbo, et al.
Published: (2026)

Partitioning Message Passing for Graph Fraud Detection
by: Zhuo, Wei, et al.
Published: (2024)

Relaxed Clique Percolation and Disinformation-Resilient Domains for Social Commerce Networks
by: Paul, Himangshu, et al.
Published: (2024)

On Clique Graphs and Clique Regular Graphs
by: Petro, Robert R., et al.
Published: (2025)

FlexCross: High-Speed and Flexible Packet Processing via a Crosspoint-Queued Crossbar
by: Zyla, Klajd, et al.
Published: (2024)

NPAP: Network Partitioning and Aggregation Package for Python
by: Anarmo, Marco, et al.
Published: (2026)

Availability-aware Service Placement Policy in Fog Computing Based on Graph Partitions
by: Lera, Isaac, et al.
Published: (2024)

ExClique: An Express Consensus Algorithm for High-Speed Transaction Process in Blockchains
by: Zhao, Chonghe, et al.
Published: (2025)

Quantum Annealing Algorithms for Estimating Ising Partition Functions
by: Li, Haowei, et al.
Published: (2025)

WOCD: A Semi-Supervised Method for Overlapping Community Detection Using Weak Cliques
by: Ma, Shaozhen, et al.
Published: (2025)

Optimizing Connected Components Graph Partitioning With Minimum Size Constraints Using Integer Programming and Spectral Clustering Techniques
by: Mishelle Cordero, et al.
Published: (2024)

The Robustness of Structural Features in Species Interaction Networks
by: Fard, Sanaz Hasanzadeh, et al.
Published: (2025)

Causal inference for social network formation
by: Kasy, Maximilian, et al.
Published: (2026)

Edge Clique Partition and Cover Beyond Independence
by: Fomin, Fedor V., et al.
Published: (2025)

Hierarchical-Graph-Structured Edge Partition Models for Learning Evolving Community Structure
by: Yu, Xincan, et al.
Published: (2024)

Maximum Defective Clique Computation: Improved Time Complexities and Practical Performance
by: Chang, Lijun
Published: (2024)

Speeding Up Sequential Markov Chain Monte Carlo Methods in the Context of Large Volumes of Data From Distributed Sensor Networks
by: Allan De Freitas, et al.
Published: (2026)