@article{Azevedo1993,
author = "Azevedo, Jos\'{e}Augusto and {Santos Costa}, Maria Em\'{\i}lia O. and {Silvestre Madeira}, Joaquim Jo\~{a}o E.R. and {Vieira Martins}, Ernesto Q.",
doi = "10.1016/0377-2217(93)90095-5",
issn = "03772217",
journal = "European Journal of Operational Research",
keyword = "labelling algorithms,network,principle of optimality,shortest path",
link = "http://linkinghub.elsevier.com/retrieve/pii/0377221793900955",
month = "aug",
number = "1",
pages = "97--106",
title = "An algorithm for the ranking of shortest paths",
uri = "http://linkinghub.elsevier.com/retrieve/pii/0377221793900955",
volume = "69",
year = "1993",
}
@article{Babic1993,
author = "Babi\'{c}, Darko and Graovac, Ante",
doi = "10.1016/0166-218X(93)90055-S",
issn = "0166218X",
journal = "Discrete Applied Mathematics",
link = "http://www.sciencedirect.com/science/article/pii/0166218X9390055S",
month = "aug",
number = "2",
pages = "117--123",
title = "Enumeration of Acyclic Walks in a Graph",
uri = "http://www.sciencedirect.com/science/article/pii/0166218X9390055S",
volume = "45",
year = "1993",
}
@inproceedings{Boros2004a,
address = "Prague, Czech Republic",
author = "Boros, Endre and Elbassioni, Khaled and Gurvich, Vladimir",
booktitle = "MFCS 2004: the 29th International Symposium on Mathematical Foundations of Computer Science",
doi = "10.1007/978-3-540-28629-5_21",
editor = "Fiala, Jiř\'{\i} and Koubek, V\'{a}clav and Kratochv\'{\i}l, Jan",
link = "http://link.springer.com/chapter/10.1007/978-3-540-28629-5_21",
month = "aug",
number = "Di",
pages = "298--309",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Generating paths and cuts in multi-pole (di) graphs",
uri = "http://link.springer.com/chapter/10.1007/978-3-540-28629-5_21",
volume = "3153",
year = "2004",
}
@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{Eppstein1998,
author = "Eppstein, David",
doi = "10.1137/S0097539795290477",
issn = "0097-5397",
journal = "SIAM Journal on Computing",
link = "http://epubs.siam.org/doi/abs/10.1137/S0097539795290477",
month = "jan",
number = "2",
pages = "652--673",
title = "Finding the K Shortest Paths",
uri = "http://epubs.siam.org/doi/abs/10.1137/S0097539795290477",
volume = "28",
year = "1998",
}
@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{Florian1981,
author = "Florian, M. and Nguyen, S. and Pallottino, S.",
doi = "10.1002/net.3230110406",
issn = "00283045",
journal = "Networks",
link = "http://doi.wiley.com/10.1002/net.3230110406",
number = "4",
pages = "367--378",
title = "A dual simplex algorithm for finding all shortest paths",
uri = "http://doi.wiley.com/10.1002/net.3230110406",
volume = "11",
year = "1981",
}
@article{Gen-Huey1994,
author = "Gen-Huey, Chen and Yung-Chen, Hung",
doi = "10.1016/0305-0548(94)90045-0",
issn = "03050548",
journal = "Computers \& Operations Research",
link = "http://www.sciencedirect.com/science/article/pii/0305054894900450 http://linkinghub.elsevier.com/retrieve/pii/0305054894900450",
month = "feb",
number = "2",
pages = "113--118",
title = "Algorithms for the Constrained Quickest Path Problem and the Enumeration of Quickest Paths",
uri = "http://www.sciencedirect.com/science/article/pii/0305054894900450",
volume = "21",
year = "1994",
}
@article{Hoang2013,
author = "Ho\`{a}ng, Ch\'{\i}nh T. and Kamiński, Marcin and Sawada, Joe and Sritharan, R.",
doi = "10.1016/j.dam.2012.01.024",
issn = "0166218X",
journal = "Discrete Applied Mathematics",
keyword = "Graph algorithm,Induced cycle,Induced path",
link = "http://www.sciencedirect.com/science/article/pii/S0166218X12000327 http://linkinghub.elsevier.com/retrieve/pii/S0166218X12000327",
month = "mar",
number = "4-5",
pages = "633--641",
title = "Finding and listing induced paths and cycles",
uri = "http://www.sciencedirect.com/science/article/pii/S0166218X12000327",
volume = "161",
year = "2013",
}
@article{Hu1967,
author = "Hu, T. C.",
doi = "10.1137/0115017",
issn = "0036-1399",
journal = "SIAM Journal on Applied Mathematics",
link = "http://epubs.siam.org/doi/10.1137/0115017",
month = "jan",
number = "1",
pages = "207--218",
title = "Revised Matrix Algorithms for Shortest Paths",
uri = "http://epubs.siam.org/doi/10.1137/0115017",
volume = "15",
year = "1967",
}
@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{Khachiyan2007,
author = "Khachiyan, Leonid and Boros, Endre and Elbassioni, Khaled and Gurvich, Vladimir and Makino, Kazuhisa",
doi = "10.1016/j.dam.2006.04.032",
issn = "0166218X",
journal = "Discrete Applied Mathematics",
month = "jan",
number = "2",
pages = "137--149",
title = "Enumerating disjunctions and conjunctions of paths and cuts in reliability theory",
volume = "155",
year = "2007",
}
@article{Kroft1967b,
author = "Kroft, D.",
doi = "10.1109/PROC.1967.5389",
issn = "0018-9219",
journal = "Proceedings of the IEEE",
link = "http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=1447319",
month = "jan",
number = "1",
pages = "88--90",
title = "All paths through a maze",
uri = "http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=1447319",
volume = "55",
year = "1967",
}
@article{Lawler1972,
author = "Lawler, E. L.",
doi = "10.1287/mnsc.18.7.401",
issn = "0025-1909",
journal = "Management Science",
link = "http://pubsonline.informs.org/doi/abs/10.1287/mnsc.18.7.401",
number = "7",
pages = "401--405",
title = "A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem",
uri = "http://pubsonline.informs.org/doi/abs/10.1287/mnsc.18.7.401",
volume = "18",
year = "1972",
}
@article{Martins1984,
author = "Martins, Ernesto de Queir\'{o}s Vieira",
doi = "10.1016/0377-2217(84)90269-8",
issn = "01716468",
journal = "European Journal of Operational Research",
link = "http://www.sciencedirect.com/science/article/pii/0377221784902698",
number = "1",
pages = "123--130",
title = "An algorithm for ranking paths that may contain cycles",
uri = "http://www.sciencedirect.com/science/article/pii/0377221784902698",
volume = "18",
year = "1984",
}
@article{Megiddo1981,
author = "Megiddo, N. and Tamir, A. and Zemel, E. and Chandrasekaran, R.",
doi = "10.1137/0210023",
issn = "0097-5397",
journal = "SIAM Journal on Computing",
keyword = "1,by several authors that,fact,found in linear time,in some structured sets,in the cardinality of,introduction,it has been observed,it is now well,known that the kth,largest element of an,location theory,ordered,p-center,polynomial algorithm,s,selection,set s can be,since the discovery of,that,the kth largest,tree",
link = "http://epubs.siam.org/doi/abs/10.1137/0210023",
number = "2",
pages = "328--337",
title = "An $O(n\log^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems",
uri = "http://epubs.siam.org/doi/abs/10.1137/0210023",
volume = "10",
year = "1981",
}
@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{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{Rosen1991,
author = "Rosen, J.B. and Sun, S.-Z. and Xue, G.-L.",
doi = "10.1016/0305-0548(91)90063-W",
issn = "03050548",
journal = "Computers \& Operations Research",
link = "http://www.sciencedirect.com/science/article/pii/030505489190063W http://linkinghub.elsevier.com/retrieve/pii/030505489190063W",
month = "jan",
number = "6",
pages = "579--584",
title = "Algorithms for the Quickest Path Problem and the Enumeration of Quickest Paths",
uri = "http://www.sciencedirect.com/science/article/pii/030505489190063W",
volume = "18",
year = "1991",
}
@article{Shier1979,
author = "Shier, D. R.",
doi = "10.1002/net.3230090303",
issn = "00283045",
journal = "Networks",
link = "http://doi.wiley.com/10.1002/net.3230090303",
number = "3",
pages = "195--214",
title = "On algorithms for finding the k shortest paths in a network",
uri = "http://doi.wiley.com/10.1002/net.3230090303",
volume = "9",
year = "1979",
}
@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{Yen1971,
author = "Yen, J. Y.",
doi = "10.1287/mnsc.17.11.712",
issn = "0025-1909",
journal = "Management Science",
link = "http://pubsonline.informs.org/doi/abs/10.1287/mnsc.17.11.712",
number = "11",
pages = "712--716",
title = "Finding the K Shortest Loopless Paths in a Network",
uri = "http://pubsonline.informs.org/doi/abs/10.1287/mnsc.17.11.712",
volume = "17",
year = "1971",
}