@article{Akkoyunlu1973,
author = "Akkoyunlu, E. A.",
doi = "10.1137/0202001",
issn = "0097-5397",
journal = "SIAM Journal on Computing",
keyword = "1,algorithms,clique,e the set of,edges,enumeration,fig,g,graph,identify completely connected subgraphs,if so is the,introduction,is best formulated in,of an undirected graph,or cliques,set of nodes and,terms,the goal is to,the problem considered here,which are",
link = "http://epubs.siam.org/doi/abs/10.1137/0202001",
month = "mar",
number = "1",
pages = "1--6",
title = "The Enumeration of Maximal Cliques of Large Graphs",
uri = "http://epubs.siam.org/doi/abs/10.1137/0202001",
volume = "2",
year = "1973",
}
@article{Bouchitte2002,
author = "Bouchitt{\'e}, Vincent and Todinca, Ioan",
doi = "10.1016/S0304-3975(01)00007-X",
journal = "Theoretical Computer Science",
link = "http://www.sciencedirect.com/science/article/pii/S030439750100007X",
month = "apr",
number = "1",
pages = "17--32",
publisher = "Elsevier",
title = "Listing all potential maximal cliques of a graph",
uri = "http://www.sciencedirect.com/science/article/pii/S030439750100007X",
volume = "276",
year = "2002",
}
@article{Bron1973,
author = "Bron, Coen and Kerbosch, Joep",
doi = "10.1145/362342.362367",
eprint = "citation.cfm?doid=362342.362367",
issn = "00010782",
journal = "Communications of the ACM",
keyword = "backtracking algorithm,branch and bound technique,cliques,clusters,maximal complete subgraphs,recursion",
link = "http://dl.acm.org/citation.cfm?id=362342.362367 http://portal.acm.org/citation.cfm?doid=362342.362367",
month = "sep",
number = "9",
pages = "575--577",
publisher = "ACM",
title = "Algorithm 457: finding all cliques of an undirected graph",
uri = "http://dl.acm.org/citation.cfm?id=362342.362367",
volume = "16",
year = "1973",
zzzisbn = "0001-0782",
}
@inproceedings{Bulo2007,
address = "Alicante, Spain",
author = "Bulo, Sr and Torsello, Andrea and Pelillo, Marcello",
booktitle = "GbRPR 2007: the 6th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition",
doi = "10.1007/978-3-540-72903-7_6",
editor = "Escolano, Francisco and Vento, Mario",
link = "http://link.springer.com/chapter/10.1007/978-3-540-72903-7_6",
month = "jun",
pages = "61--70",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "A continuous-based approach for partial clique enumeration",
uri = "http://link.springer.com/chapter/10.1007/978-3-540-72903-7_6",
volume = "4538",
year = "2007",
}
@article{Chang2013,
author = "Chang, Lijun and Yu, Jeffrey Xu and Qin, Lu",
doi = "10.1007/s00453-012-9632-8",
issn = "01784617",
journal = "Algorithmica",
keyword = "H-Partition,H-Value,Maximal clique,Polynomial delay,Sparse graph",
language = "English",
link = "http://link.springer.com/10.1007/s00453-012-9632-8 http://dx.doi.org/10.1007/s00453-012-9632-8",
month = "mar",
number = "1",
pages = "173--186",
publisher = "Springer-Verlag",
title = "Fast Maximal Cliques Enumeration in Sparse Graphs",
uri = "http://link.springer.com/10.1007/s00453-012-9632-8",
volume = "66",
year = "2013",
}
@inproceedings{Cheng2012b,
address = "Beijing, China",
author = "Cheng, James and Zhu, Linhong and Ke, Yiping and Chu, Shumo",
booktitle = "KDD 2012: the 18th ACM SIGKDD international conference on Knowledge discovery and data mining",
doi = "10.1145/2339530.2339724",
editor = "Yang, Qiang",
isbn = "9781450314626",
keyword = "i/o efficient,massive networks,maximal clique enumeration,parallel algorithm,sparse graphs",
link = "http://dl.acm.org/citation.cfm?doid=2339530.2339724",
month = "aug",
pages = "1240",
publisher = "ACM Press",
title = "Fast algorithms for maximal clique enumeration with limited memory",
uri = "http://dl.acm.org/citation.cfm?doid=2339530.2339724",
year = "2012",
}
@article{Chiba1985,
author = "Chiba, Norishige and Nishizeki, Takao",
doi = "10.1137/0214017",
issn = "0097-5397",
journal = "SIAM Journal on Computing",
keyword = "arboricity,clique,complete subgraph,independent set,quadrangle,subgraph listing algorithm,triangle",
language = "en",
link = "http://epubs.siam.org/doi/abs/10.1137/0214017",
month = "feb",
number = "1",
pages = "210--223",
publisher = "Society for Industrial and Applied Mathematics",
title = "Arboricity and Subgraph Listing Algorithms",
uri = "http://epubs.siam.org/doi/abs/10.1137/0214017",
volume = "14",
year = "1985",
}
@inproceedings{Conte2016,
address = "Dagstuhl, Germany",
author = "Conte, Alessio and Grossi, Roberto and Marino, Andrea and Versari, Luca",
booktitle = "ICALP 2016: the 43rd International Colloquium on Automata, Languages, and Programming",
doi = "10.4230/LIPIcs.ICALP.2016.148",
editor = "{Ioannis Chatzigiannakis Michael Mitzenmacher}, Yuval Rabani and Sangiorgi, Davide",
isbn = "978-3-95977-013-2",
issn = "1868-8969",
link = "http://drops.dagstuhl.de/opus/volltexte/2016/6292",
pages = "148:1----148:15",
publisher = "Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik",
series = "Leibniz International Proceedings in Informatics (LIPIcs)",
title = "Sublinear-Space Bounded-Delay Enumeration for Massive Network Analytics: Maximal Cliques",
uri = "http://drops.dagstuhl.de/opus/volltexte/2016/6292",
volume = "55",
year = "2016",
}
@article{Dias2005,
author = "Dias, V\^{a}nia M.F. and de Figueiredo, Celina M.H. and Szwarcfiter, Jayme L.",
doi = "10.1016/j.tcs.2005.01.014",
issn = "03043975",
journal = "Theoretical Computer Science",
keyword = "Algorithms,Biclique,Enumeration,Lexicographic order,NP-complete,Polynomial-time delay",
link = "http://www.sciencedirect.com/science/article/pii/S030439750500037X http://linkinghub.elsevier.com/retrieve/pii/S030439750500037X",
month = "jun",
number = "1-3",
pages = "240--248",
title = "Generating Bicliques of a Graph in Lexicographic Order",
uri = "http://www.sciencedirect.com/science/article/pii/S030439750500037X",
volume = "337",
year = "2005",
}
@inproceedings{Du2009,
address = "Hong Kong, China",
author = "Du, Nan and Wu, Bin and Xu, Liutong and Wang, Bai and Pei, Xin",
booktitle = "ICDMW 2006: the 6th IEEE International Conference on Data Mining - Workshops",
doi = "10.1109/ICDMW.2006.17",
isbn = "0-7695-2702-7",
keyword = "Application software,Bioinformatics,Complex networks,Computer science,Data mining,Graph theory,Intelligent networks,Laboratories,Parallel algorithms,Telecommunication computing,complex network,computational complexity,graph theory,graph-based link mining,maximal clique problem,parallel algorithm,parallel algorithms",
link = "http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=4063647",
month = "dec",
pages = "320--324",
publisher = "IEEE",
title = "A Parallel Algorithm for Enumerating All Maximal Cliques in Complex Network",
uri = "http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=4063647",
year = "2006",
zzzeditor = "-, -",
}
@inproceedings{Eppstein2010,
address = "Jeju Island, Korea",
author = "Eppstein, David and L\"{o}ffler, M and Strash, Darren",
booktitle = "ISAAC 2010: the 21st International Symposium on Algorithms and Computation",
doi = "10.1007/978-3-642-17517-6_36",
editor = "Cheong, Otfried and Chwa, Kyung-Yong and Park, Kunsoo",
keyword = "bron,d -degenerate graphs,fixed-parameter tractability,kerbosch algorithm,maximal clique listing algorithms,sparse graphs",
link = "http://link.springer.com/chapter/10.1007/978-3-642-17517-6_36",
month = "dec",
pages = "403--414",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Listing all maximal cliques in sparse graphs in near-optimal time",
uri = "http://link.springer.com/chapter/10.1007/978-3-642-17517-6_36",
volume = "6506",
year = "2010",
}
@article{Gely2009,
author = "G\'{e}ly, Alain and Nourine, Lhouari and Sadi, Bachir",
doi = "10.1016/j.dam.2008.10.010",
issn = "0166218X",
journal = "Discrete Applied Mathematics",
keyword = "Enumeration algorithms,Lattice,Maximal bicliques,Maximal cliques",
link = "http://www.sciencedirect.com/science/article/pii/S0166218X08004563 http://linkinghub.elsevier.com/retrieve/pii/S0166218X08004563",
month = "apr",
number = "7",
pages = "1447--1459",
title = "Enumeration aspects of maximal cliques and bicliques",
uri = "http://www.sciencedirect.com/science/article/pii/S0166218X08004563",
volume = "157",
year = "2009",
}
@article{Gerhards1979,
author = "Gerhards, L. and Lindenberg, W.",
doi = "10.1007/BF02248731",
issn = "0010485X",
journal = "Computing",
link = "http://link.springer.com/10.1007/BF02248731",
month = "dec",
number = "4",
pages = "295--322",
title = "Clique detection for nondirected graphs: Two new algorithms",
uri = "http://link.springer.com/10.1007/BF02248731",
volume = "21",
year = "1979",
}
@article{Harary1957,
author = "Frank Harary and Ian C. Ross",
doi = "10.2307/2785673",
issn = "00380431",
journal = "Sociometry",
link = "http://www.jstor.org/stable/2785673",
number = "3",
pages = "205-215",
publisher = "[American Sociological Association, Sage Publications, Inc.]",
title = "A Procedure for Clique Detection Using the Group Matrix",
uri = "http://www.jstor.org/stable/2785673",
volume = "20",
year = "1957",
}
@inproceedings{Henry2013,
address = "Banff, Canada",
author = "Henry, CJ and Ramanna, Sheela",
booktitle = "Transactions on Rough Sets XVI",
doi = "10.1007/978-3-642-36505-8_7",
editor = "Peters, James F. and Skowron, Andrzej and Ramanna, Sheela and Suraj, Zbigniew and Wang, Xin",
keyword = "cbir,maximal clique enumeration,near sets,nearness measure,pre-class,tolerance near sets,tolerance relation,tolerance space",
link = "http://link.springer.com/chapter/10.1007/978-3-642-36505-8_7",
month = "oct",
pages = "103--124",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Maximal clique enumeration in Finding Near Neighbourhoods",
uri = "http://link.springer.com/chapter/10.1007/978-3-642-36505-8_7",
volume = "7736",
year = "2013",
}
@article{Huffner2009,
author = "H\"{u}ffner, Falk and Komusiewicz, Christian and Moser, Hannes and Niedermeier, Rolf",
doi = "10.1016/j.tcs.2009.05.008",
issn = "03043975",
journal = "Theoretical Computer Science",
keyword = "Algorithm engineering,Dense subgraph,Exact algorithm,Fixed-parameter tractability,NP-hard problem",
link = "http://www.sciencedirect.com/science/article/pii/S0304397509003570 http://linkinghub.elsevier.com/retrieve/pii/S0304397509003570",
month = "dec",
number = "52",
pages = "5384--5397",
title = "Isolation Concepts for Clique Enumeration: Comparison and Computational Experiments",
uri = "http://www.sciencedirect.com/science/article/pii/S0304397509003570",
volume = "410",
year = "2009",
}
@article{Ito2009,
author = "Ito, Hiro and Iwama, Kazuo",
doi = "10.1145/1597036.1597044",
issn = "15496325",
journal = "ACM Transactions on Algorithms",
keyword = "Clique,enumeration,isolation",
link = "http://dl.acm.org/citation.cfm?id=1597036.1597044",
month = "oct",
number = "4",
pages = "1--21",
publisher = "ACM",
title = "Enumeration of isolated cliques and pseudo-cliques",
uri = "http://dl.acm.org/citation.cfm?id=1597036.1597044",
volume = "5",
year = "2009",
}
@article{Johnston1976,
author = "Johnston, H. C.",
doi = "10.1007/BF00991836",
issn = "0091-7036",
journal = "International Journal of Computer \& Information Sciences",
keyword = "Cliques,combinatorial programming,graph theory,stepwise refinement,tree search",
link = "http://link.springer.com/10.1007/BF00991836",
month = "sep",
number = "3",
pages = "209--238",
title = "Cliques of a graph-variations on the Bron-Kerbosch algorithm",
uri = "http://link.springer.com/10.1007/BF00991836",
volume = "5",
year = "1976",
}
@article{Kashiwabara1992,
author = "Kashiwabara, Toshinobu and Masuda, Sumio and Nakajima, Kazuo and Fujisawa, Toshio",
doi = "10.1016/0196-6774(92)90012-2",
issn = "01966774",
journal = "Journal of Algorithms",
link = "http://www.sciencedirect.com/science/article/pii/0196677492900122",
month = "mar",
number = "1",
pages = "161--174",
title = "Generation of Maximum Independent Sets of a Bipartite Graph and Maximum Cliques of a Circular-Arc Graph",
uri = "http://www.sciencedirect.com/science/article/pii/0196677492900122",
volume = "13",
year = "1992",
}
@article{Kiyomi2006,
author = "Kiyomi, Masashi and Takeaki, Uno",
doi = "10.1093/ietisy/e89-d.2.763",
issn = "0916-8532",
journal = "IEICE Transactions on Information and Systems",
keyword = "chordal graph,constant time,enumeration",
link = "http://search.ieice.org/bin/summary.php?id=e89-d_2_763\&category=D\&year=2006\&lang=E\&abst= http://search.ieice.org/bin/summary.php?id=e89-d_2_763",
month = "feb",
number = "2",
pages = "763--770",
title = "Generating Chordal Graphs Included in Given Graphs",
uri = "http://search.ieice.org/bin/summary.php?id=e89-d_2_763&category=D&year=2006&lang=E&abst=",
volume = "E89-D",
year = "2006",
}
@article{Komusiewicz2009,
author = "Komusiewicz, Christian and H{\"{u}}ffner, Falk and Moser, Hannes and Niedermeier, Rolf",
doi = "10.1016/j.tcs.2009.04.021",
isbn = "9783540735441",
issn = "03043975",
journal = "Theoretical Computer Science",
number = "38-40",
pages = "3640--3654",
publisher = "Elsevier B.V.",
title = "Isolation concepts for efficiently enumerating dense subgraphs",
volume = "410",
year = "2009",
}
@inproceedings{Makino2004,
address = "Humleb\ae k, Denmark",
author = "Makino, Kazuhisa and Uno, Takeaki",
booktitle = "SWAT 2004: the 9th Scandinavian Workshop on Algorithm Algorithm Theory",
doi = "10.1007/978-3-540-27810-8_23",
editor = "Hagerup, Torben and Katajainen, Jyrki",
link = "http://link.springer.com/chapter/10.1007/978-3-540-27810-8_23",
month = "jul",
pages = "260--272",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "New algorithms for enumerating all maximal cliques",
uri = "http://link.springer.com/chapter/10.1007/978-3-540-27810-8_23",
volume = "3111",
year = "2004",
}
@article{Mulligan1972,
author = "Mulligan, Gordon D. and Corneil, D. G.",
doi = "10.1145/321694.321698",
issn = "00045411",
journal = "Journal of the ACM",
link = "http://portal.acm.org/citation.cfm?doid=321694.321698",
month = "apr",
number = "2",
pages = "244--247",
publisher = "ACM",
title = "Corrections to Bierstone's Algorithm for Generating Cliques",
uri = "http://portal.acm.org/citation.cfm?doid=321694.321698",
volume = "19",
year = "1972",
}
@inproceedings{Pan2008,
address = "Singapore",
author = "Pan, Long and Santos, Eunice E.",
booktitle = "the IEEE International Conference on Systems, Man and Cybernetics - SMC 2008",
doi = "10.1109/ICSMC.2008.4811845",
isbn = "978-1-4244-2383-5",
issn = "1062922X",
keyword = "Anytime anywhere methodologies,Maximal clique,Social network analysis",
link = "http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=4811845",
month = "oct",
pages = "3529--3535",
publisher = "IEEE",
title = "An anytime-anywhere approach for maximal clique enumeration in social network analysis",
uri = "http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=4811845",
year = "2008",
zzzeditor = "-, -",
}
@article{Rotem1981,
author = "Rotem, Doron and Urrutia, Julia",
doi = "10.1002/net.3230110305",
issn = "00283045",
journal = "Networks",
link = "http://onlinelibrary.wiley.com/doi/10.1002/net.3230110305/abstract",
number = "3",
pages = "269--278",
title = "Finding Maximum Cliques In Circle Graphs",
uri = "http://onlinelibrary.wiley.com/doi/10.1002/net.3230110305/abstract",
volume = "11",
year = "1981",
}
@article{Schmidt2009,
author = "Schmidt, Matthew C. and Samatova, Nagiza F. and Thomas, Kevin and Park, Byung-Hoon",
doi = "10.1016/j.jpdc.2009.01.003",
issn = "07437315",
journal = "Journal of Parallel and Distributed Computing",
keyword = "Biological networks,Cray XT,Dynamic load balancing,High-performance computing,Maximal clique enumeration,Parallel graph algorithms",
link = "http://www.sciencedirect.com/science/article/pii/S0743731509000082 http://linkinghub.elsevier.com/retrieve/pii/S0743731509000082",
month = "apr",
number = "4",
pages = "417--428",
title = "A Scalable, Parallel Algorithm for Maximal Clique Enumeration",
uri = "http://www.sciencedirect.com/science/article/pii/S0743731509000082",
volume = "69",
year = "2009",
}
@article{Stix2004,
author = "Stix, Volker",
doi = "10.1023/B:COAP.0000008651.28952.b6",
issn = "0926-6003",
journal = "Computational Optimization and Applications",
link = "http://link.springer.com/10.1023/B:COAP.0000008651.28952.b6",
month = "feb",
number = "2",
pages = "173--186",
title = "Finding All Maximal Cliques in Dynamic Graphs",
uri = "http://link.springer.com/10.1023/B:COAP.0000008651.28952.b6",
volume = "27",
year = "2004",
}
@article{Tomita2006,
author = "Tomita, Etsuji and Tanaka, Akira and Takahashi, Haruhisa",
doi = "10.1016/j.tcs.2006.06.015",
issn = "03043975",
journal = "Theoretical Computer Science",
keyword = "Computational experiments,Enumeration,Maximal cliques,Worst-case time complexity",
link = "http://www.sciencedirect.com/science/article/pii/S0304397506003586 http://linkinghub.elsevier.com/retrieve/pii/S0304397506003586",
month = "oct",
number = "1",
pages = "28--42",
title = "The Worst-Case Time Complexity for Generating All Maximal Cliques and Computational Experiments",
uri = "http://www.sciencedirect.com/science/article/pii/S0304397506003586",
volume = "363",
year = "2006",
}
@article{Uno2008a,
author = "Uno, Takeaki",
doi = "10.1007/s00453-008-9238-3",
issn = "01784617",
journal = "Algorithmica",
keyword = "Algorithm,Clustering,Community discovering,Dense structure,Dense subgraph,Enumeration,Maximum subgraph,Mining,Pseudo clique,Quasi clique",
link = "http://link.springer.com/10.1007/s00453-008-9238-3",
month = "oct",
number = "1",
pages = "3--16",
title = "An efficient algorithm for solving pseudo clique enumeration problem",
uri = "http://link.springer.com/10.1007/s00453-008-9238-3",
volume = "56",
year = "2010",
}