Listing All Maximal Cliques in Sparse Graphs in Near-optimal Time

David Eppstein, Maarten Löffler, Darren Strash

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

Original language	English
Title of host publication	Proc. 21st International Symposium on Algorithms and Computation
Pages	403-414
Number of pages	12
DOIs	https://doi.org/10.1007/978-3-642-17517-6_36
Publication status	Published - 2010

Name	LNCS 6506

Keywords

@inproceedings{4e29fc168e5d4670aeaadb36ffe1f856,

title = "Listing All Maximal Cliques in Sparse Graphs in Near-optimal Time",

keywords = "GRAPH, FPT, SOCIAL",

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

year = "2010",

doi = "10.1007/978-3-642-17517-6\_36",

language = "English",

series = "LNCS 6506",

pages = "403--414",

booktitle = "Proc. 21st International Symposium on Algorithms and Computation",

}

TY - GEN

T1 - Listing All Maximal Cliques in Sparse Graphs in Near-optimal Time

AU - Eppstein, David

AU - Löffler, Maarten

AU - Strash, Darren

PY - 2010

Y1 - 2010

KW - GRAPH, FPT, SOCIAL

U2 - 10.1007/978-3-642-17517-6_36

DO - 10.1007/978-3-642-17517-6_36

M3 - Conference contribution

T3 - LNCS 6506

SP - 403

EP - 414

BT - Proc. 21st International Symposium on Algorithms and Computation

ER -