Listing All Maximal Cliques in Large Sparse Real-World Graphs in Near-Optimal Time

Research output: Contribution to journal › Article › Academic › peer-review

Original language	English
Journal	Journal of Experimental Algorithmics
DOIs	https://doi.org/10.1145/2543629
Publication status	Published - 2013

els-lamc-13 (to appear)

Keywords

@article{e5db889834f64325b1020cd7aa6234b1,

title = "Listing All Maximal Cliques in Large Sparse Real-World Graphs in Near-Optimal Time",

keywords = "GRAPH, FPT, SOCIAL",

author = "David Eppstein and Maarten L{\"o}ffler and Darren Strash",

note = "els-lamc-13 (to appear)",

year = "2013",

doi = "10.1145/2543629",

language = "English",

journal = "Journal of Experimental Algorithmics",

issn = "1084-6654",

publisher = "Association for Computing Machinery",

}

TY - JOUR

T1 - Listing All Maximal Cliques in Large Sparse Real-World Graphs in Near-Optimal Time

AU - Eppstein, David

AU - Löffler, Maarten

AU - Strash, Darren

N1 - els-lamc-13 (to appear)

PY - 2013

Y1 - 2013

KW - GRAPH, FPT, SOCIAL

U2 - 10.1145/2543629

DO - 10.1145/2543629

M3 - Article

SN - 1084-6654

JO - Journal of Experimental Algorithmics

JF - Journal of Experimental Algorithmics

ER -