Problème de la plus longue chaîne (French Wikipedia)

Analysis of information sources in references of the Wikipedia article "Problème de la plus longue chaîne" in French language version.

refsWebsite

Global rank French rank

8doi.org

2^nd place

3^rd place

8ams.org

451^st place

1,058^th place

3books.google.com

3^rd place

11^th place

1tamu.edu

1,672^nd place

4,540^th place

1uprrp.edu

low place

1arxiv.org

69^th place

232^nd place

1siam.org

low place

9,268^th place

1irif.fr

low place

1semanticscholar.org

11^th place

325^th place

1dur.ac.uk

3,728^th place

8,701^st place

ams.org

Harold N. Gabow et Shuxin Nie, « Finding long paths, cycles and circuits », International Symposium on Algorithms and Computation, Berlin, Springer Lecture Notes in Computer Science 5369,‎ 2008, p. 752–763 (DOI 10.1007/978-3-540-92182-0_66, MR 2539968).
David Karger, Rajeev Motwani et G. D. S. Ramkumar, « On approximating the longest path in a graph », Algorithmica, vol. 18, n^o 1,‎ 1997, p. 82–98 (DOI 10.1007/BF02523689, MR 1432030).
Andreas Björklund, Thore Husfeldt et Sanjeev Khanna, « Approximating longest directed paths and cycles », Proc. Int. Coll. Automata, Languages and Programming (ICALP), Berlin, Springer Lecture Notes in Computer Science 3142,‎ 2004, p. 222–233 (MR 2160935).
Noga Alon, Raphael Yuster et Uri Zwick, « Color-coding », Journal of the ACM, vol. 42, n^o 4,‎ 1995, p. 844–856 (DOI 10.1145/210332.210337, MR 1411787).
Hans L. Bodlaender, « On linear time minor tests with depth-first search », Journal of Algorithms, vol. 14, n^o 1,‎ 1993, p. 1–23 (DOI 10.1006/jagm.1993.1001, MR 1199244).
Ioannis Koutis, « Faster algebraic algorithms for path and packing problems », International Colloquium on Automata, Languages and Programming, Berlin, Springer, lecture Notes in Computer Science,‎ 2008, p. 575–586 (DOI 10.1007/978-3-540-70575-8_47, MR 2500302, lire en ligne).
Ryan Williams, « Finding paths of length k in O*(2^k) time », Information Processing Letters, vol. 109, n^o 6,‎ 2009, p. 315–318 (DOI 10.1016/j.ipl.2008.11.004, MR 2493730, arXiv 0807.3026).
Kyriaki Ioannidou, George B. Mertzios et Stavros D. Nikolopoulos, « The longest path problem has a polynomial solution on interval graphs », Algorithmica, vol. 61, n^o 2,‎ 2011, p. 320–341 (DOI 10.1007/s00453-010-9411-3, MR 2822187, lire en ligne).

arxiv.org

Ryan Williams, « Finding paths of length k in O*(2^k) time », Information Processing Letters, vol. 109, n^o 6,‎ 2009, p. 315–318 (DOI 10.1016/j.ipl.2008.11.004, MR 2493730, arXiv 0807.3026).

books.google.com

Alexander Schrijver, Combinatorial Optimization : Polyhedra and Efficiency, Volume 1, Springer (n^o 24), 2003, 1881 p. (ISBN 978-3-540-44389-6, lire en ligne), p. 114.
Eugene L. Lawler, Combinatorial Optimization : Networks and Matroids, Courier Dover Publications, 2001, 374 p. (ISBN 978-0-486-41453-9, lire en ligne), p. 64.
(en) Robert Sedgewick et Kevin Daniel Wayne, Algorithms, Upper Saddle River, Addison-Wesley Professional, 2011, 4^e éd., 955 p. (ISBN 978-0-321-57351-3, lire en ligne), p. 661–666.

doi.org

dx.doi.org

Harold N. Gabow et Shuxin Nie, « Finding long paths, cycles and circuits », International Symposium on Algorithms and Computation, Berlin, Springer Lecture Notes in Computer Science 5369,‎ 2008, p. 752–763 (DOI 10.1007/978-3-540-92182-0_66, MR 2539968).
David Karger, Rajeev Motwani et G. D. S. Ramkumar, « On approximating the longest path in a graph », Algorithmica, vol. 18, n^o 1,‎ 1997, p. 82–98 (DOI 10.1007/BF02523689, MR 1432030).
Noga Alon, Raphael Yuster et Uri Zwick, « Color-coding », Journal of the ACM, vol. 42, n^o 4,‎ 1995, p. 844–856 (DOI 10.1145/210332.210337, MR 1411787).
Hans L. Bodlaender, « On linear time minor tests with depth-first search », Journal of Algorithms, vol. 14, n^o 1,‎ 1993, p. 1–23 (DOI 10.1006/jagm.1993.1001, MR 1199244).
Ioannis Koutis, « Faster algebraic algorithms for path and packing problems », International Colloquium on Automata, Languages and Programming, Berlin, Springer, lecture Notes in Computer Science,‎ 2008, p. 575–586 (DOI 10.1007/978-3-540-70575-8_47, MR 2500302, lire en ligne).
Ryan Williams, « Finding paths of length k in O*(2^k) time », Information Processing Letters, vol. 109, n^o 6,‎ 2009, p. 315–318 (DOI 10.1016/j.ipl.2008.11.004, MR 2493730, arXiv 0807.3026).
George B. Mertzios et Derek G. Corneil, « A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs », SIAM Journal on Discrete Mathematics, vol. 26, n^o 3,‎ 2012, p. 940–963 (DOI 10.1137/100793529, lire en ligne).
Kyriaki Ioannidou, George B. Mertzios et Stavros D. Nikolopoulos, « The longest path problem has a polynomial solution on interval graphs », Algorithmica, vol. 61, n^o 2,‎ 2011, p. 320–341 (DOI 10.1007/s00453-010-9411-3, MR 2822187, lire en ligne).

dur.ac.uk

dro.dur.ac.uk

Kyriaki Ioannidou, George B. Mertzios et Stavros D. Nikolopoulos, « The longest path problem has a polynomial solution on interval graphs », Algorithmica, vol. 61, n^o 2,‎ 2011, p. 320–341 (DOI 10.1007/s00453-010-9411-3, MR 2822187, lire en ligne).

irif.fr

Michel Habib, « Parcours de graphes », Institut de recherche en informatique fondamentale (IRIF), 2009 (consulté le 29 novembre 2016).

semanticscholar.org

pdfs.semanticscholar.org

George B. Mertzios et Derek G. Corneil, « A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs », SIAM Journal on Discrete Mathematics, vol. 26, n^o 3,‎ 2012, p. 940–963 (DOI 10.1137/100793529, lire en ligne).

siam.org

Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov et Saket Saurabh, « Clique-width: on the price of generality », Proc. 20th ACM-SIAM Symposium on Discrete Algorithms (SODA '09),‎ 2009, p. 825–834 (lire en ligne).

tamu.edu

faculty.cse.tamu.edu

Jianer Chen, Songjian Lu, Sing-Hoi Sze et Fenghui Zhang, « Improved algorithms for path, matching, and packing problems », Proc. 18th ACM-SIAM Symposium on Discrete algorithms (SODA '07),‎ 2007, p. 298–307 (ISBN 978-0-898716-24-5, lire en ligne).

uprrp.edu

ccom.uprrp.edu

Ioannis Koutis, « Faster algebraic algorithms for path and packing problems », International Colloquium on Automata, Languages and Programming, Berlin, Springer, lecture Notes in Computer Science,‎ 2008, p. 575–586 (DOI 10.1007/978-3-540-70575-8_47, MR 2500302, lire en ligne).