Arbre d'expansió (Catalan Wikipedia)

Analysis of information sources in references of the Wikipedia article "Arbre d'expansió" in Catalan language version.

refsWebsite

Global rank Catalan rank

9doi.org

2^nd place

6^th place

8google.cat

1,849^th place

2^nd place

2web.archive.org

1^st place

1ucsd.edu

1,933^rd place

1,450^th place

1gatech.edu

4,448^th place

5,302^nd place

1uci.edu

3,063^rd place

2,902^nd place

1ox.ac.uk

613^th place

508^th place

1sciencedirect.com

149^th place

111^th place

1worldcat.org

5^th place

doi.org

dx.doi.org

Harary, Frank; Hayes, John P.; Wu, Horng-Jyh «A survey of the theory of hypercube graphs». Computers & Mathematics with Applications, 15, 4, 1988, p. 277–289. DOI: 10.1016/0898-1221(88)90213-1.
Goldberg, L.A.; Jerrum, M. «Inapproximability of the Tutte polynomial». Information and Computation, 206, 7, 2008, p. 908. DOI: 10.1016/j.ic.2008.04.003.; Jaeger, F.; Vertigan, D. L.; Welsh, D. J. A. «On the computational complexity of the Jones and Tutte polynomials». Mathematical Proceedings of the Cambridge Philosophical Society, 108, 1990, p. 35–53. DOI: 10.1017/S0305004100068936.
Reif, John H. «Depth-first search is inherently sequential». Information Processing Letters, 20, 5, 1985, p. 229–234. DOI: 10.1016/0020-0190(85)90024-9.
Gallager, R. G.; Humblet, P. A.; Spira, P. M. «A distributed algorithm for minimum-weight spanning trees». ACM Transactions on Programming Languages and Systems, 5, 1, 1983, p. 66–77. DOI: 10.1145/357195.357200.; Gazit, Hillel «An optimal randomized parallel algorithm for finding connected components in a graph». SIAM Journal on Computing, 20, 6, 1991, p. 1046–1067. DOI: 10.1137/0220066.; Bader, David A.; Cong, Guojing «Còpia arxivada». Journal of Parallel and Distributed Computing, 65, 9, 2005, p. 994–1006. Arxivat de l'original el 2015-09-23. DOI: 10.1016/j.jpdc.2005.03.011 [Consulta: 29 desembre 2015]. «Còpia arxivada». Arxivat de l'original el 2015-09-23. [Consulta: 29 desembre 2015].
Wilson, David Bruce. Proceedings of the Twenty-eighth Annual ACM Symposium on the Theory of Computing (STOC 1996), 1996, p. 296–303. DOI 10.1145/237814.237880. «Generating random spanning trees more quickly than the cover time»
McDiarmid, Colin; Johnson, Theodore; Stone, Harold S. «Còpia arxivada». Random Structures & Algorithms, 10, 1-2, 1997, p. 187–204. Arxivat de l'original el 2016-03-04. DOI: 10.1002/(SICI)1098-2418(199701/03)10:1/2<187::AID-RSA10>3.3.CO;2-Y [Consulta: 29 desembre 2015]. «Còpia arxivada». Arxivat de l'original el 2016-03-04. [Consulta: 29 desembre 2015].
Gabow, Harold N.; Myers, Eugene W. «Finding all spanning trees of directed and undirected graphs». SIAM Journal on Computing, 7, 3, 1978, p. 280–287. DOI: 10.1137/0207024.
Soukup, Lajos. Horizons of combinatorics. 17. Berlin: Springer, 2008, p. 189–213. DOI 10.1007/978-3-540-77200-2_10. «Infinite combinatorics: from finite to infinite» . Vegeu en particular el Teorema 2.1, pp. 192–193.
"Lionel Levine" «Sandpile groups and spanning trees of directed line graphs». Journal of Combinatorial Theory, Series A, 118, 2011, pàg. 350 - 364. DOI: 10.1016/j.jcta.2010.04.001. ISSN: 0097-3165.

gatech.edu

cc.gatech.edu

Gallager, R. G.; Humblet, P. A.; Spira, P. M. «A distributed algorithm for minimum-weight spanning trees». ACM Transactions on Programming Languages and Systems, 5, 1, 1983, p. 66–77. DOI: 10.1145/357195.357200.; Gazit, Hillel «An optimal randomized parallel algorithm for finding connected components in a graph». SIAM Journal on Computing, 20, 6, 1991, p. 1046–1067. DOI: 10.1137/0220066.; Bader, David A.; Cong, Guojing «Còpia arxivada». Journal of Parallel and Distributed Computing, 65, 9, 2005, p. 994–1006. Arxivat de l'original el 2015-09-23. DOI: 10.1016/j.jpdc.2005.03.011 [Consulta: 29 desembre 2015]. «Còpia arxivada». Arxivat de l'original el 2015-09-23. [Consulta: 29 desembre 2015].

google.cat

books.google.cat

Oxley, J. G.. Matroid Theory. 3. Oxford University Press, 2006, p. 141. ISBN 978-0-19-920250-8.
Bollobás, Béla. Modern Graph Theory. 184. Springer, 1998, p. 350. ISBN 978-0-387-98488-9. ; Mehlhorn, Kurt. LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press, 1999, p. 260. ISBN 978-0-521-56329-1.
Cameron, Peter J. Combinatorics: Topics, Techniques, Algorithms. Cambridge University Press, 1994, p. 163. ISBN 978-0-521-45761-3.
Gross, Jonathan L.; Yellen, Jay. Graph Theory and Its Applications. 2a edició. CRC Press, 2005, p. 168. ISBN 978-1-58488-505-4. ; Bondy, J. A.; Murty, U. S. R.. Graph Theory. 244. Springer, 2008, p. 578. ISBN 978-1-84628-970-5.
Hartsfield, Nora; Ringel, Gerhard. Pearls in Graph Theory: A Comprehensive Introduction. Courier Dover Publications, 2003, p. 100. ISBN 978-0-486-43232-8.
Kocay, William; Kreher, Donald L. Graphs, Algorithms, and Optimization. CRC Press, 2004, p. 111-116. ISBN 978-0-203-48905-5. «5.8 The matrix-tree theorem»
Kozen, Dexter. The Design and Analysis of Algorithms. Springer, 1992, p. 19. ISBN 978-0-387-97687-7.
Soukup, Lajos. Horizons of combinatorics. 17. Berlin: Springer, 2008, p. 189–213. DOI 10.1007/978-3-540-77200-2_10. «Infinite combinatorics: from finite to infinite» . Vegeu en particular el Teorema 2.1, pp. 192–193.

ox.ac.uk

stats.ox.ac.uk

McDiarmid, Colin; Johnson, Theodore; Stone, Harold S. «Còpia arxivada». Random Structures & Algorithms, 10, 1-2, 1997, p. 187–204. Arxivat de l'original el 2016-03-04. DOI: 10.1002/(SICI)1098-2418(199701/03)10:1/2<187::AID-RSA10>3.3.CO;2-Y [Consulta: 29 desembre 2015]. «Còpia arxivada». Arxivat de l'original el 2016-03-04. [Consulta: 29 desembre 2015].

sciencedirect.com

"Lionel Levine" «Sandpile groups and spanning trees of directed line graphs». Journal of Combinatorial Theory, Series A, 118, 2011, pàg. 350 - 364. DOI: 10.1016/j.jcta.2010.04.001. ISSN: 0097-3165.

uci.edu

ics.uci.edu

Eppstein, David. Spanning trees and spanners. Elsevier, 1999, p. 425–461.

ucsd.edu

math.ucsd.edu

R. L. Graham and Pavol Hell. "On the History of the Minimum Spanning Tree Problem". 1985.

web.archive.org

Gallager, R. G.; Humblet, P. A.; Spira, P. M. «A distributed algorithm for minimum-weight spanning trees». ACM Transactions on Programming Languages and Systems, 5, 1, 1983, p. 66–77. DOI: 10.1145/357195.357200.; Gazit, Hillel «An optimal randomized parallel algorithm for finding connected components in a graph». SIAM Journal on Computing, 20, 6, 1991, p. 1046–1067. DOI: 10.1137/0220066.; Bader, David A.; Cong, Guojing «Còpia arxivada». Journal of Parallel and Distributed Computing, 65, 9, 2005, p. 994–1006. Arxivat de l'original el 2015-09-23. DOI: 10.1016/j.jpdc.2005.03.011 [Consulta: 29 desembre 2015]. «Còpia arxivada». Arxivat de l'original el 2015-09-23. [Consulta: 29 desembre 2015].
McDiarmid, Colin; Johnson, Theodore; Stone, Harold S. «Còpia arxivada». Random Structures & Algorithms, 10, 1-2, 1997, p. 187–204. Arxivat de l'original el 2016-03-04. DOI: 10.1002/(SICI)1098-2418(199701/03)10:1/2<187::AID-RSA10>3.3.CO;2-Y [Consulta: 29 desembre 2015]. «Còpia arxivada». Arxivat de l'original el 2016-03-04. [Consulta: 29 desembre 2015].

worldcat.org

"Lionel Levine" «Sandpile groups and spanning trees of directed line graphs». Journal of Combinatorial Theory, Series A, 118, 2011, pàg. 350 - 364. DOI: 10.1016/j.jcta.2010.04.001. ISSN: 0097-3165.