@article{Alon1997,
author = "Alon, N and Yuster, R. and Zwick, U.",
doi = "10.1007/BF02523189",
issn = "0178-4617",
journal = "Algorithmica",
keyword = "1,a i n s,a simple cycle of,c o n t,clearly np-,cycles,d e c i,d i n g,e,e m o f,easily stated algorithmic graph,g i v e,graph algorithms,h e r a,i n t r,if the cycle length,k is part of,length k is among,n g r a,o d u c,p h g,problems,r o b l,t h e p,t i o n,the input,the most natural and,then the problem is,v,w h e t",
link = "http://link.springer.com/10.1007/BF02523189",
month = "mar",
number = "3",
pages = "209--223",
title = "Finding and counting given length cycles",
uri = "http://link.springer.com/10.1007/BF02523189",
volume = "17",
year = "1997",
}
@article{Char1970,
author = "Char, J.P.",
doi = "10.1049/piee.1970.0292",
journal = "Proceedings of the Institution of Electrical Engineers",
link = "http://digital-library.theiet.org/content/journals/10.1049/piee.1970.0292",
number = "8",
pages = "1655",
title = "Master circuit matrix",
uri = "http://digital-library.theiet.org/content/journals/10.1049/piee.1970.0292",
volume = "117",
year = "1970",
}
@article{Danielson1968,
author = "Danielson, G.",
doi = "10.1109/TCT.1968.1082837",
issn = "0018-9324",
journal = "IEEE Transactions on Circuit Theory",
link = "http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=1082837",
month = "sep",
number = "3",
pages = "294--295",
title = "On finding the simple paths and circuits in a graph",
uri = "http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=1082837",
volume = "15",
year = "1968",
}
@article{DOGRUSOZ1996,
author = "DO\bar{G}RUS\"OZ, U. and KRISHNAMOORTHY, M. S.",
doi = "10.1080/10637199608915603",
issn = "1063-7192",
journal = "Parallel Algorithms and Applications",
month = "aug",
number = "1-2",
pages = "21--36",
title = "ENUMERATING ALL CYCLES OF A PLANAR GRAPH",
volume = "10",
year = "1996",
}
@techreport{Ehrenfeucht1973,
author = "Ehrenfeucht, Andrzej and Fosdick, Lloyd D. and Osterweil, Leon J.",
institution = "Dept. of Computer Sci., Univ. of Colorado, Boulder",
link = "http://scholar.colorado.edu/csci_techreports/23",
number = "CU-CS-024-23",
pages = "1--54",
title = "An algorithm for finding the elementary circuits of a directed graph",
uri = "http://scholar.colorado.edu/csci_techreports/23",
year = "1973",
}
@inproceedings{Ferreira2012,
address = "New Orleans, LA, USA",
arxivid = "1205.2766v2",
author = "Birmel\'{e}, Etienne and Ferreira, Rui and Grossi, Roberto and Marino, Andrea and Pisanti, Nadia and Rizzi, Romeo and Sacomoto, Gustavo",
booktitle = "SODA 2012: the 24th Annual ACM-SIAM Symposium on Discrete Algorithms",
doi = "10.1137/1.9781611973105.134",
editor = "Khanna, Sanjeev",
eprint = "1205.2766v2",
link = "http://knowledgecenter.siam.org/0236-000084/0236-000084/1 http://adsabs.harvard.edu/abs/2012arXiv1205.2766F",
month = "jan",
pages = "1884--1896",
title = "Optimal Listing of Cycles and st-Paths in Undirected Graphs",
uri = "http://knowledgecenter.siam.org/0236-000084/0236-000084/1",
year = "2012",
}
@inproceedings{Ferreira2014,
address = "Wroclaw, Poland",
author = "Ferreira, Rui and Grossi, Roberto and Rizzi, Romeo and Sacomoto, Gustavo and Marie-France, Sagot",
booktitle = "ESA 2014: the 22th Annual European Symposium on Algorithms",
doi = "10.1007/978-3-662-44777-2_35",
editor = "Schulz, Andreas S. and Wagner, Dorothea",
link = "http://link.springer.com/chapter/10.1007/978-3-662-44777-2_35",
month = "sep",
pages = "418--429",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Amortized $\tilde\{O\}(|V|)$ -Delay Algorithm for Listing Chordless Cycles in Undirected Graphs",
uri = "http://link.springer.com/chapter/10.1007/978-3-662-44777-2_35",
volume = "8737",
year = "2014",
}
@article{Gilbert1958,
author = "Gilbert, E. N.",
doi = "10.1002/j.1538-7305.1958.tb03887.x",
journal = "Bell System Technical Journal",
link = "http://ieeexplore.ieee.org/articleDetails.jsp?arnumber=6773372",
month = "may",
number = "3",
pages = "815--826",
publisher = "Alcatel-Lucent",
title = "Gray Codes and Paths on the n-Cube",
uri = "http://ieeexplore.ieee.org/articleDetails.jsp?arnumber=6773372",
volume = "37",
year = "1958",
}
@article{Johnson1975,
author = "Johnson, Donald B.",
doi = "10.1137/0204007",
issn = "0097-5397",
journal = "SIAM Journal on Computing",
keyword = "1,algorithm,broadly speaking,circuit,cycle,digraph,enumeration,every,graph,introduction,is determining how many,is the construction of,objects,problems on,set,sets of objects,the one,the other,there are in the,there are two enumeration,which we call counting,which we call finding",
link = "http://epubs.siam.org/doi/abs/10.1137/0204007",
month = "mar",
number = "1",
pages = "77--84",
title = "Finding All the Elementary Circuits of a Directed Graph",
uri = "http://epubs.siam.org/doi/abs/10.1137/0204007",
volume = "4",
year = "1975",
}
@article{Kamae1967,
author = "Kamae, T.",
doi = "10.1109/TCT.1967.1082699",
issn = "0018-9324",
journal = "IEEE Transactions on Circuit Theory",
link = "http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=1082699",
month = "jun",
number = "2",
pages = "166--171",
title = "A Systematic Method of Finding All Directed Circuits and Enumerating All DIrected Paths",
uri = "http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=1082699",
volume = "14",
year = "1967",
}
@article{Loizou1982,
author = "Loizou, G. and Thanisch, P.",
doi = "10.1016/0020-0255(82)90023-8",
issn = "00200255",
journal = "Information Sciences",
link = "http://linkinghub.elsevier.com/retrieve/pii/0020025582900238",
month = "aug",
number = "3",
pages = "163--182",
title = "Enumerating the cycles of a digraph: A new preprocessing strategy",
uri = "http://linkinghub.elsevier.com/retrieve/pii/0020025582900238",
volume = "27",
year = "1982",
}
@article{Ponstein1966,
author = "Ponstein, J.",
doi = "10.1137/0114051",
issn = "0036-1399",
journal = "SIAM Journal on Applied Mathematics",
keyword = "J. Ponstein",
link = "http://epubs.siam.org/doi/abs/10.1137/0114051",
month = "mar",
number = "3",
pages = "600--609",
title = "Self-Avoiding Paths and the Adjacency Matrix of a Graph",
uri = "http://epubs.siam.org/doi/abs/10.1137/0114051",
volume = "14",
year = "1966",
}
@article{Rao1969,
author = "{Bapeswara Rao}, V.V. and Murti, V.G.K.",
doi = "10.1109/PROC.1969.7032",
issn = "0018-9219",
journal = "Proceedings of the IEEE",
link = "http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=1448962",
number = "4",
pages = "700--701",
title = "Enumeration of all circuits of a graph",
uri = "http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=1448962",
volume = "57",
year = "1969",
}
@article{Read1975,
author = "Read, Ronald C. and Tarjan, Robert Endre",
journal = "Networks",
link = "http://scholar.google.com/scholar?hl=en{\&}btnG=Search{\&}q=intitle:Bounds+on+backtrack+algorithms+for+listing+cycles,+paths,+and+Spanning+trees.\#0",
number = "3",
pages = "237--252",
title = "Bounds on backtrack algorithms for listing cycles, paths, and spanning trees",
uri = "http://scholar.google.com/scholar?hl=en{&}btnG=Search{&}q=intitle:Bounds+on+backtrack+algorithms+for+listing+cycles,+paths,+and+Spanning+trees.#0",
volume = "5",
year = "1975",
}
@article{Srimani1979,
author = "Srimani, Pradip K.",
doi = "10.1109/PROC.1979.11455",
issn = "0018-9219",
journal = "Proceedings of the IEEE",
link = "http://ieeexplore.ieee.org/document/1455724/",
number = "9",
pages = "1361--1362",
title = "Generation of directed circuits in a directed graph",
uri = "http://ieeexplore.ieee.org/document/1455724/",
volume = "67",
year = "1979",
}
@article{Syso1981,
author = "Sys{\l}o, Maciej M.",
doi = "10.1137/0210062",
issn = "0097-5397",
journal = "SIAM Journal on Computing",
keyword = "1,a graph g,a simple graph g,all-cycle algorithm,an edge is denoted,and edges e,and m,by e uv,cycle basis,cycle graph,cycle space method,denote the number of,e,g,introduction,is a collection of,let n,number of edges of,planar graph,resp,simple graphs do,v,vertices,vertices and the",
link = "http://epubs.siam.org/doi/abs/10.1137/0210062",
month = "nov",
number = "4",
pages = "797--808",
title = "An Efficient Cycle Vector Space Algorithm for Listing All Cycles of a Planar Graph",
uri = "http://epubs.siam.org/doi/abs/10.1137/0210062",
volume = "10",
year = "1981",
}
@article{Szwarcfiter1976,
author = "Szwarcfiter, Jayme L. and Lauer, Peter E.",
doi = "10.1007/BF01931370",
issn = "00063835",
journal = "BIT",
link = "http://link.springer.com/10.1007/BF01931370",
month = "jun",
number = "2",
pages = "192--204",
title = "A search strategy for the elementary cycles of a directed graph",
uri = "http://link.springer.com/10.1007/BF01931370",
volume = "16",
year = "1976",
}
@article{Tarjan1973,
author = "Tarjan, Robert",
doi = "10.1137/0202017",
issn = "0097-5397",
journal = "SIAM Journal on Computing",
link = "http://epubs.siam.org/doi/abs/10.1137/0202017",
month = "sep",
number = "3",
pages = "211--216",
title = "Enumeration of the Elementary Circuits of a Directed Graph",
uri = "http://epubs.siam.org/doi/abs/10.1137/0202017",
volume = "2",
year = "1973",
}
@article{Tiernan1970,
author = "Tiernan, James C.",
doi = "10.1145/362814.362819",
issn = "00010782",
journal = "Communications of the ACM",
keyword = "algorithm,circuit search algorithm,graph theory,path search algorithm,searching",
link = "http://dl.acm.org/citation.cfm?id=362814.362819 http://portal.acm.org/citation.cfm?doid=362814.362819",
month = "dec",
number = "12",
pages = "722--726",
publisher = "ACM",
title = "An efficient search algorithm to find the elementary circuits of a graph",
uri = "http://dl.acm.org/citation.cfm?id=362814.362819",
volume = "13",
year = "1970",
}
@inproceedings{Unoc,
address = "Bled, Slovenia",
author = "Uno, Takeaki and Satoh, Hiroko",
booktitle = "DS 2014: the 17th International Conference on Discovery Science",
doi = "10.1007/978-3-319-11812-3_27",
editor = "D\v{z}eroski, Sa\v{s}o and Panov, Pan\v{c}e and Kocev, Dragi and Todorovski, Ljup\v{c}o",
link = "http://link.springer.com/chapter/10.1007/978-3-319-11812-3_27",
month = "oct",
pages = "313--324",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "An Efficient Algorithm for Enumerating Chordless Cycles and Chordless Paths",
uri = "http://link.springer.com/chapter/10.1007/978-3-319-11812-3_27",
volume = "8777",
year = "2014",
}
@article{Weinblatt1972,
author = "Weinblatt, Herbert",
doi = "10.1145/321679.321684",
issn = "00045411",
journal = "Journal of the ACM",
link = "http://dl.acm.org/citation.cfm?id=321679.321684",
month = "jan",
number = "1",
pages = "43--56",
publisher = "ACM",
title = "A New Search Algorithm for Finding the Simple Cycles of a Finite Directed Graph",
uri = "http://dl.acm.org/citation.cfm?id=321679.321684",
volume = "19",
year = "1972",
}
@inproceedings{Welch1965,
address = "New York, New York, USA",
author = "Welch, J T",
booktitle = "Proceedings of the 1965 20th national conference",
doi = "10.1145/800197.806053",
editor = "",
link = "http://portal.acm.org/citation.cfm?doid=800197.806053",
month = "aug",
pages = "296--301",
publisher = "ACM Press",
title = "Cycle Algorithms for Undirected Linear Graphs and Some immediate Applications",
uri = "http://portal.acm.org/citation.cfm?doid=800197.806053",
year = "1965",
}
@article{Welch1966,
author = "Welch, John T.",
doi = "10.1145/321328.321331",
issn = "00045411",
journal = "Journal of the ACM",
link = "http://portal.acm.org/citation.cfm?doid=321328.321331",
month = "apr",
number = "2",
pages = "205--210",
title = "A Mechanical Analysis of the Cyclic Structure of Undirected Linear Graphs",
uri = "http://portal.acm.org/citation.cfm?doid=321328.321331",
volume = "13",
year = "1966",
}
@article{Wild2008,
author = "Wild, Marcel",
doi = "10.1016/j.jda.2007.01.005",
issn = "15708667",
journal = "Journal of Discrete Algorithms",
keyword = "Generating all Hamiltonian cycles,Generating all chordless cycles,Generating all cycles",
link = "http://www.sciencedirect.com/science/article/pii/S1570866707000020 http://linkinghub.elsevier.com/retrieve/pii/S1570866707000020",
month = "mar",
number = "1",
pages = "93--102",
title = "Generating all cycles, chordless cycles, and Hamiltonian cycles with the principle of exclusion",
uri = "http://www.sciencedirect.com/science/article/pii/S1570866707000020",
volume = "6",
year = "2008",
}