Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection (Q4985798): Difference between revisions

Latest revision as of 13:48, 25 July 2024

scientific article; zbMATH DE number 7338060

Language	Label	Description	Also known as
English	Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection	scientific article; zbMATH DE number 7338060

Statements

instance of

scholarly article

0 references

title

Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection (English)

0 references

author

Bharath Pattabiraman

0 references

Md. Mostofa Ali Patwary

0 references

Wei-Keng Liao

0 references

Assefaw Hadish Gebremedhin

0 references

0 references

0 references

26 April 2021

0 references

full work available at URL

https://arxiv.org/abs/1411.7460

0 references

describes a project that uses

0 references

0 references

0 references

0 references

0 references

0 references

MaRDI publication profile

0 references

cites work

An Analysis of Some Graph Theoretical Cluster Techniques

0 references

A branch and bound algorithm for the maximum clique problem

0 references

Statistical analysis of financial networks

0 references

Q3145799

0 references

On Some Clustering Techniques

0 references

A new table of constant weight codes

0 references

An exact algorithm for the maximum clique problem

0 references

The university of Florida sparse matrix collection

0 references

Listing All Maximal Cliques in Large Sparse Real-World Graphs

0 references

Relaxing the uniformity and independence assumptions using the concept of fractal dimension

0 references

Mixed constraint preconditioning in computational contact mechanics

0 references

Q4198056

0 references

Handbook of Graph Theory

0 references

Q3713407

0 references

Q5687246

0 references

Q2837833

0 references

Multi-threading a state-of-the-art maximum clique algorithm

0 references

A fast algorithm for the maximum clique problem

0 references

The maximum clique problem

0 references

Exact algorithms for maximum clique: a computational study

0 references

An exact bit-parallel algorithm for the maximum clique problem

0 references

Q4452109

0 references

A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique

0 references

An order-clique-based approach for mining maximal co-locations

0 references

Identifiers

zbMATH Open document ID

1461.05219

0 references

DOI

10.1080/15427951.2014.986778

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4985798

@@ Property / OpenAlex ID @@
+W1594951361
@@ Property / OpenAlex ID: W1594951361 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.7460
@@ Property / arXiv ID: 1411.7460 / rank @@
+Normal rank
@@ Property / cites work @@
+An Analysis of Some Graph Theoretical Cluster Techniques
+Normal rank
@@ Property / cites work @@
+A branch and bound algorithm for the maximum clique problem
+Normal rank
@@ Property / cites work @@
+Statistical analysis of financial networks
@@ Property / cites work: Statistical analysis of financial networks / rank @@
+Normal rank
@@ Property / cites work @@
+Q3145799
@@ Property / cites work: Q3145799 / rank @@
+Normal rank
@@ Property / cites work @@
+On Some Clustering Techniques
@@ Property / cites work: On Some Clustering Techniques / rank @@
+Normal rank
@@ Property / cites work @@
+A new table of constant weight codes
@@ Property / cites work: A new table of constant weight codes / rank @@
+Normal rank
@@ Property / cites work @@
+An exact algorithm for the maximum clique problem
@@ Property / cites work: An exact algorithm for the maximum clique problem / rank @@
+Normal rank
@@ Property / cites work @@
+The university of Florida sparse matrix collection
+Normal rank
@@ Property / cites work @@
+Listing All Maximal Cliques in Large Sparse Real-World Graphs
+Normal rank
@@ Property / cites work @@
+Relaxing the uniformity and independence assumptions using the concept of fractal dimension
+Normal rank
@@ Property / cites work @@
+Mixed constraint preconditioning in computational contact mechanics
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Handbook of Graph Theory
@@ Property / cites work: Handbook of Graph Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q3713407
@@ Property / cites work: Q3713407 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5687246
@@ Property / cites work: Q5687246 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2837833
@@ Property / cites work: Q2837833 / rank @@
+Normal rank
@@ Property / cites work @@
+Multi-threading a state-of-the-art maximum clique algorithm
+Normal rank
@@ Property / cites work @@
+A fast algorithm for the maximum clique problem
@@ Property / cites work: A fast algorithm for the maximum clique problem / rank @@
+Normal rank
@@ Property / cites work @@
+The maximum clique problem
@@ Property / cites work: The maximum clique problem / rank @@
+Normal rank
@@ Property / cites work @@
+Exact algorithms for maximum clique: a computational study
+Normal rank
@@ Property / cites work @@
+An exact bit-parallel algorithm for the maximum clique problem
+Normal rank
@@ Property / cites work @@
+Q4452109
@@ Property / cites work: Q4452109 / rank @@
+Normal rank
@@ Property / cites work @@
+A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
+Normal rank
@@ Property / cites work @@
+An order-clique-based approach for mining maximal co-locations
+Normal rank