Problema do caminho mais longo (Portuguese Wikipedia)
Analysis of information sources in references of the Wikipedia article "Problema do caminho mais longo" in Portuguese language version.
refsWebsite
Global rank
Portuguese rank
3rd place
6th place
2,526th place
2,541st place
1st place
1st place
ams.org
- Björklund, Andreas; Husfeldt, Thore; Khanna, Sanjeev (2004), «Approximating longest directed paths and cycles», Proc. Int. Coll. Automata, Languages and Programming (ICALP 2004), Lecture Notes in Computer Science, 3142, Berlin: Springer-Verlag, pp. 222–233, MR 2160935.
- Gabow, Harold N.; Nie, Shuxin (2008), «Finding long paths, cycles and circuits», International Symposium on Algorithms and Computation, Lecture Notes in Computer Science, 5369, Berlin: Springer, pp. 752–763, MR 2539968, doi:10.1007/978-3-540-92182-0_66. For earlier work with even weaker approximation bounds, see Gabow, Harold N. (2007), «Finding paths and cycles of superpolylogarithmic length» (PDF), SIAM Journal on Computing, 36 (6): 1648–1671, MR 2299418, doi:10.1137/S0097539704445366 and Björklund, Andreas; Husfeldt, Thore (2003), «Finding a path of superlogarithmic length», SIAM Journal on Computing, 32 (6): 1395–1402, MR 2034242, doi:10.1137/S0097539702416761.
- Karger, David; Motwani, Rajeev; Ramkumar, G. D. S. (1997), «On approximating the longest path in a graph», Algorithmica, 18 (1): 82–98, MR 1432030, doi:10.1007/BF02523689.
- Alon, Noga; Yuster, Raphael; Zwick, Uri (1995), «Color-coding», Journal of the ACM, 42 (4): 844–856, MR 1411787, doi:10.1145/210332.210337.
- Bodlaender, Hans L. (1993), «On linear time minor tests with depth-first search», Journal of Algorithms, 14 (1): 1–23, MR 1199244, doi:10.1006/jagm.1993.1001. For an earlier FPT algorithm with slightly better dependence on the path length, but worse dependence on the size of the graph, see Monien, B. (1985), «How to find long paths efficiently», Analysis and design of algorithms for combinatorial problems (Udine, 1982), North-Holland Math. Stud., 109, Amsterdam: North-Holland, pp. 239–254, MR 808004, doi:10.1016/S0304-0208(08)73110-4.
- Koutis, Ioannis (2008), «Faster algebraic algorithms for path and packing problems», International Colloquium on Automata, Languages and Programming (PDF), Lecture Notes in Computer Science, 5125, Berlin: Springer, pp. 575–586, MR 2500302, doi:10.1007/978-3-540-70575-8_47.
- Williams, Ryan (2009), «Finding paths of length k in O*(2k) time», Information Processing Letters, 109 (6): 315–318, MR 2493730, arXiv:0807.3026
, doi:10.1016/j.ipl.2008.11.004. - Ioannidou, Kyriaki; Nikolopoulos, Stavros D. (2011), «The longest path problem is polynomial on cocomparability graphs» (PDF), Algorithmica, doi:10.1007/s00453-011-9583-5. For earlier work on more restrictive subclasses of co-comparability graphs, see Ioannidou, Kyriaki; Mertzios, George B.; Nikolopoulos, Stavros D. (2011), «The longest path problem has a polynomial solution on interval graphs» (PDF), Algorithmica, 61 (2): 320–341, MR 2822187, doi:10.1007/s00453-010-9411-3 and Uehara, Ryuhei; Valiente, Gabriel (2007), «Linear structure of bipartite permutation graphs and the longest path problem», Information Processing Letters, 103 (2): 71–77, MR 2322071, doi:10.1016/j.ipl.2007.02.010.
arxiv.org
- Williams, Ryan (2009), «Finding paths of length k in O*(2k) time», Information Processing Letters, 109 (6): 315–318, MR 2493730, arXiv:0807.3026, doi:10.1016/j.ipl.2008.11.004.
books.google.com
- Schrijver, Alexander (2003), Combinatorial Optimization: Polyhedra and Efficiency, Volume 1, ISBN 9783540443896, Algorithms and Combinatorics, 24, Springer, p. 114.
- Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2001), Introduction To Algorithms, ISBN 9780262032933 2nd ed. , MIT Press, p. 978.
- Lawler, Eugene L. (2001), Combinatorial Optimization: Networks and Matroids, ISBN 9780486414539, Courier Dover Publications, p. 64.
- Sedgewick, Robert; Wayne, Kevin Daniel (2011), Algorithms, ISBN 9780321573513 4th ed. , Addison-Wesley Professional, pp. 661–666.
colorado.edu
cs.colorado.edu
- Gabow, Harold N.; Nie, Shuxin (2008), «Finding long paths, cycles and circuits», International Symposium on Algorithms and Computation, Lecture Notes in Computer Science, 5369, Berlin: Springer, pp. 752–763, MR 2539968, doi:10.1007/978-3-540-92182-0_66. For earlier work with even weaker approximation bounds, see Gabow, Harold N. (2007), «Finding paths and cycles of superpolylogarithmic length» (PDF), SIAM Journal on Computing, 36 (6): 1648–1671, MR 2299418, doi:10.1137/S0097539704445366 and Björklund, Andreas; Husfeldt, Thore (2003), «Finding a path of superlogarithmic length», SIAM Journal on Computing, 32 (6): 1395–1402, MR 2034242, doi:10.1137/S0097539702416761.
doi.org
dx.doi.org
- Gabow, Harold N.; Nie, Shuxin (2008), «Finding long paths, cycles and circuits», International Symposium on Algorithms and Computation, Lecture Notes in Computer Science, 5369, Berlin: Springer, pp. 752–763, MR 2539968, doi:10.1007/978-3-540-92182-0_66. For earlier work with even weaker approximation bounds, see Gabow, Harold N. (2007), «Finding paths and cycles of superpolylogarithmic length» (PDF), SIAM Journal on Computing, 36 (6): 1648–1671, MR 2299418, doi:10.1137/S0097539704445366 and Björklund, Andreas; Husfeldt, Thore (2003), «Finding a path of superlogarithmic length», SIAM Journal on Computing, 32 (6): 1395–1402, MR 2034242, doi:10.1137/S0097539702416761.
- Karger, David; Motwani, Rajeev; Ramkumar, G. D. S. (1997), «On approximating the longest path in a graph», Algorithmica, 18 (1): 82–98, MR 1432030, doi:10.1007/BF02523689.
- Alon, Noga; Yuster, Raphael; Zwick, Uri (1995), «Color-coding», Journal of the ACM, 42 (4): 844–856, MR 1411787, doi:10.1145/210332.210337.
- Bodlaender, Hans L. (1993), «On linear time minor tests with depth-first search», Journal of Algorithms, 14 (1): 1–23, MR 1199244, doi:10.1006/jagm.1993.1001. For an earlier FPT algorithm with slightly better dependence on the path length, but worse dependence on the size of the graph, see Monien, B. (1985), «How to find long paths efficiently», Analysis and design of algorithms for combinatorial problems (Udine, 1982), North-Holland Math. Stud., 109, Amsterdam: North-Holland, pp. 239–254, MR 808004, doi:10.1016/S0304-0208(08)73110-4.
- Koutis, Ioannis (2008), «Faster algebraic algorithms for path and packing problems», International Colloquium on Automata, Languages and Programming (PDF), Lecture Notes in Computer Science, 5125, Berlin: Springer, pp. 575–586, MR 2500302, doi:10.1007/978-3-540-70575-8_47.
- Williams, Ryan (2009), «Finding paths of length k in O*(2k) time», Information Processing Letters, 109 (6): 315–318, MR 2493730, arXiv:0807.3026, doi:10.1016/j.ipl.2008.11.004.
- Ioannidou, Kyriaki; Nikolopoulos, Stavros D. (2011), «The longest path problem is polynomial on cocomparability graphs» (PDF), Algorithmica, doi:10.1007/s00453-011-9583-5. For earlier work on more restrictive subclasses of co-comparability graphs, see Ioannidou, Kyriaki; Mertzios, George B.; Nikolopoulos, Stavros D. (2011), «The longest path problem has a polynomial solution on interval graphs» (PDF), Algorithmica, 61 (2): 320–341, MR 2822187, doi:10.1007/s00453-010-9411-3 and Uehara, Ryuhei; Valiente, Gabriel (2007), «Linear structure of bipartite permutation graphs and the longest path problem», Information Processing Letters, 103 (2): 71–77, MR 2322071, doi:10.1016/j.ipl.2007.02.010.
dur.ac.uk
dro.dur.ac.uk
- Ioannidou, Kyriaki; Nikolopoulos, Stavros D. (2011), «The longest path problem is polynomial on cocomparability graphs» (PDF), Algorithmica, doi:10.1007/s00453-011-9583-5. For earlier work on more restrictive subclasses of co-comparability graphs, see Ioannidou, Kyriaki; Mertzios, George B.; Nikolopoulos, Stavros D. (2011), «The longest path problem has a polynomial solution on interval graphs» (PDF), Algorithmica, 61 (2): 320–341, MR 2822187, doi:10.1007/s00453-010-9411-3 and Uehara, Ryuhei; Valiente, Gabriel (2007), «Linear structure of bipartite permutation graphs and the longest path problem», Information Processing Letters, 103 (2): 71–77, MR 2322071, doi:10.1016/j.ipl.2007.02.010.
siam.org
-
Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Saurabh, Saket (2009), «Clique-width: on the price of generality», Proc. 20th ACM-SIAM Symposium on Discrete Algorithms (SODA '09) (PDF), pp. 825–834, consultado em 30 de novembro de 2015, cópia arquivada (PDF) em
|arquivourl=requer|arquivodata=(ajuda) 🔗.
tamu.edu
faculty.cse.tamu.edu
- Chen, Jianer; Lu, Songjian; Sze, Sing-Hoi; Zhang, Fenghui (2007), «Improved algorithms for path, matching, and packing problems», Proc. 18th ACM-SIAM Symposium on Discrete algorithms (SODA '07) (PDF), pp. 298–307.
uoi.gr
cs.uoi.gr
- Ioannidou, Kyriaki; Nikolopoulos, Stavros D. (2011), «The longest path problem is polynomial on cocomparability graphs» (PDF), Algorithmica, doi:10.1007/s00453-011-9583-5. For earlier work on more restrictive subclasses of co-comparability graphs, see Ioannidou, Kyriaki; Mertzios, George B.; Nikolopoulos, Stavros D. (2011), «The longest path problem has a polynomial solution on interval graphs» (PDF), Algorithmica, 61 (2): 320–341, MR 2822187, doi:10.1007/s00453-010-9411-3 and Uehara, Ryuhei; Valiente, Gabriel (2007), «Linear structure of bipartite permutation graphs and the longest path problem», Information Processing Letters, 103 (2): 71–77, MR 2322071, doi:10.1016/j.ipl.2007.02.010.
uprrp.edu
ccom.uprrp.edu
- Koutis, Ioannis (2008), «Faster algebraic algorithms for path and packing problems», International Colloquium on Automata, Languages and Programming (PDF), Lecture Notes in Computer Science, 5125, Berlin: Springer, pp. 575–586, MR 2500302, doi:10.1007/978-3-540-70575-8_47.
web.archive.org
-
Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Saurabh, Saket (2009), «Clique-width: on the price of generality», Proc. 20th ACM-SIAM Symposium on Discrete Algorithms (SODA '09) (PDF), pp. 825–834, consultado em 30 de novembro de 2015, cópia arquivada (PDF) em
|arquivourl=requer|arquivodata=(ajuda) 🔗.