@article{Avis1996,
author = "Avis, David and Fukuda, Komei",
doi = "10.1016/0166-218X(95)00026-N",
issn = "0166218X",
journal = "Discrete Applied Mathematics",
link = "http://linkinghub.elsevier.com/retrieve/pii/0166218X9500026N",
month = "mar",
number = "1-3",
pages = "21--46",
title = "Reverse search for enumeration",
uri = "http://linkinghub.elsevier.com/retrieve/pii/0166218X9500026N",
volume = "65",
year = "1996",
}
@article{Koch2001,
author = "Koch, Ina",
doi = "10.1016/S0304-3975(00)00286-3",
issn = "03043975",
journal = "Theoretical Computer Science",
keyword = "Bron–Kerbosch algorithm,Cliques,Connected maximal common subgraphs,Graph theory",
link = "http://www.sciencedirect.com/science/article/pii/S0304397500002863 http://linkinghub.elsevier.com/retrieve/pii/S0304397500002863",
month = "jan",
number = "1-2",
pages = "1--30",
title = "Enumerating All Connected Maximal Common Subgraphs in Two Graphs",
uri = "http://www.sciencedirect.com/science/article/pii/S0304397500002863",
volume = "250",
year = "2001",
}