Image de couverture de livre

A Fast Maximum Clique Algorithm Based on Network Decomposition for Large Sparse Networks

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Fan, Tianlong, Jiang, Wenjun, Zhang, Yi-Cheng, Lü, Linyuan
Format:	Preprint
Publié:	2024
Sujets:	Social and Information Networks Data Structures and Algorithms Information Retrieval Data Analysis, Statistics and Probability 05C82(Primary), 05C80, 91D30, 68P20(Secondary) H.3.3; F.2.2; J.2
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On the Average-Case Performance of Greedy for Maximum Coverage
par: Balkanski, Eric, et autres
Publié: (2026)

The Algorithmic Phase Transition of Random Graph Alignment Problem
par: Du, Hang, et autres
Publié: (2023)

Exact Trajectory Similarity Search With N-tree: An Efficient Metric Index for kNN and Range Queries
par: Güting, Ralf Hartmut, et autres
Publié: (2024)

Latent Objective Induction and Diversity-Constrained Selection: Algorithms for Multi-Locale Retrieval Pipelines
par: Alpay, Faruk, et autres
Publié: (2026)

Network higher-order structure dismantling
par: Peng, Peng, et autres
Publié: (2024)

The Distributional Tail of Worst-Case Quickselect
par: Płecha, Witold
Publié: (2026)

ARRIVAL: Recursive Framework & $\ell_1$-Contraction
par: Haslebacher, Sebastian
Publié: (2025)

Efficient Algorithms for Injectivity and Bounded Surjectivity of One-dimensional Nonlinear Cellular Automata
par: Wang, Chen, et autres
Publié: (2023)

Dynamic Traffic Assignment for Public Transport with Vehicle Capacities
par: Patzner, Julian, et autres
Publié: (2024)

Tight Algorithm for Connected Odd Cycle Transversal Parameterized by Clique-width
par: Bojikian, Narek, et autres
Publié: (2024)

Correlation Clustering with Vertex Splitting
par: Bentert, Matthias, et autres
Publié: (2024)

Two models of sparse and clustered dynamic networks
par: Bloznelis, Mindaugas, et autres
Publié: (2024)

Reconstruction of Line-Embeddings of Graphons
par: Janssen, Jeannette, et autres
Publié: (2020)

Let them have CAKES: A Cutting-Edge Algorithm for Scalable, Efficient, and Exact Search on Big Data
par: Prior, Morgan E., et autres
Publié: (2023)

Cluster Before You Hallucinate: Approximating Node-Capacitated Network Design and Energy Efficient Routing
par: Krishnaswamy, Ravishankar, et autres
Publié: (2014)

Generalized compression and compressive search of large datasets
par: Prior, Morgan E., et autres
Publié: (2024)

Robust Detection of Planted Subgraphs in Semi-Random Models
par: Elimelech, Dor, et autres
Publié: (2025)

Tight Bounds for Feedback Vertex Set Parameterized by Clique-width
par: Bojikian, Narek, et autres
Publié: (2025)

Tight bounds on adjacency labels for monotone graph classes
par: Bonnet, Édouard, et autres
Publié: (2023)

Small But Unwieldy: A Lower Bound on Adjacency Labels for Small Classes
par: Bonnet, Édouard, et autres
Publié: (2023)

Decline and Fall of the ICALP 2008 Modular Decomposition algorithm
par: Atherton, William, et autres
Publié: (2024)

On the strength of connectedness of unions of random graphs
par: Bloznelis, Mindaugas
Publié: (2026)

Optimal root recovery for uniform attachment trees and $d$-regular growing trees
par: Addario-Berry, Louigi, et autres
Publié: (2024)

Fast FPT Algorithms for Grundy Number on Dense Graphs
par: Nezhad, Sina Ghasemi, et autres
Publié: (2024)

Maximum entropy temporal networks
par: Barucca, Paolo
Publié: (2025)

Comparative study of random walks with one-step memory on complex networks
par: Mirchev, Miroslav, et autres
Publié: (2024)

Traffic-Oblivious Multi-Commodity Flow Network Design
par: Chimani, Markus, et autres
Publié: (2025)

On the parameterized complexity of computing good edge-labelings
par: de Andrade, Davi, et autres
Publié: (2024)

Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time
par: Gartland, Peter, et autres
Publié: (2023)

Glauber dynamics for the hard-core model on bounded-degree $H$-free graphs
par: Jerrum, Mark
Publié: (2024)

Optimized Degree Realization: Minimum Dominating Set & Maximum Matching
par: Bar-Noy, Amotz, et autres
Publié: (2025)

Exact Algorithms for MaxCut on Split Graphs
par: Lalovic, Marko
Publié: (2024)

Shortest two disjoint paths in conservative graphs
par: Schlotter, Ildikó
Publié: (2023)

Pushing the Limits: Concurrency Detection in Acyclic Sound Free-Choice Workflow Nets in $O(P^2 + T^2)$
par: Prinz, Thomas M., et autres
Publié: (2024)

A Constant-factor Approximation for Weighted Bond Cover
par: Kim, Eun Jung, et autres
Publié: (2021)

Steiner Tree Parameterized by Multiway Cut and Even Less
par: Jansen, Bart M. P., et autres
Publié: (2024)

Analysis of a Spotify Collaboration Network for Small-World Properties
par: Bush, Raquel Ana Magalhães
Publié: (2025)

Memento Filter: A Fast, Dynamic, and Robust Range Filter
par: Eslami, Navid, et autres
Publié: (2024)

The Maximum Clique Problem in a Disk Graph Made Easy
par: Keil, J. Mark, et autres
Publié: (2024)

Dynamic programming on bipartite tree decompositions
par: Jaffke, Lars, et autres
Publié: (2023)