Component (graph theory) (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Component (graph theory)" in English language version.

refsWebsite
Global rank English rank
2nd place
2nd place
451st place
277th place
1st place
1st place
3rd place
3rd place
11th place
8th place
69th place
59th place
4,942nd place
4,061st place
179th place
183rd place
26th place
20th place
low place
9,141st place
207th place
136th place
206th place
124th place
18th place
17th place

ams.org

mathscinet.ams.org

arxiv.org

  • Wulff-Nilsen, Christian (2013), "Faster deterministic fully-dynamic graph connectivity", in Khanna, Sanjeev (ed.), Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013, pp. 1757–1769, arXiv:1209.5608, doi:10.1137/1.9781611973105.126, ISBN 978-1-61197-251-1, S2CID 13397958
  • Huang, Shang-En; Huang, Dawei; Kopelowitz, Tsvi; Pettie, Seth (2017), "Fully dynamic connectivity in amortized expected time", in Klein, Philip N. (ed.), Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19, pp. 510–520, arXiv:1609.05867, doi:10.1137/1.9781611974782.32, S2CID 15585534

books.google.com

  • Clark, John; Holton, Derek Allan (1995), A First Look at Graph Theory, Allied Publishers, p. 28, ISBN 9788170234630, archived from the original on 2022-01-08, retrieved 2022-01-07
  • Tutte, W. T. (1984), Graph Theory, Encyclopedia of Mathematics and its Applications, vol. 21, Reading, Massachusetts: Addison-Wesley, p. 15, ISBN 0-201-13520-5, MR 0746795, archived from the original on 2022-01-07, retrieved 2022-01-07
  • Thulasiraman, K.; Swamy, M. N. S. (2011), Graphs: Theory and Algorithms, John Wiley & Sons, p. 9, ISBN 978-1-118-03025-7, archived from the original on 2022-01-07, retrieved 2022-01-07
  • Bollobás, Béla (1998), Modern Graph Theory, Graduate Texts in Mathematics, vol. 184, New York: Springer-Verlag, p. 6, doi:10.1007/978-1-4612-0619-4, ISBN 0-387-98488-7, MR 1633290, archived from the original on 2022-01-08, retrieved 2022-01-08
  • Foldes, Stephan (2011), Fundamental Structures of Algebra and Discrete Mathematics, John Wiley & Sons, p. 199, ISBN 978-1-118-03143-8, archived from the original on 2022-01-07, retrieved 2022-01-07
  • Lewis, Harry; Zax, Rachel (2019), Essential Discrete Mathematics for Computer Science, Princeton University Press, p. 145, ISBN 978-0-691-19061-7, archived from the original on 2022-01-08, retrieved 2022-01-08
  • Kozen, Dexter C. (1992), "4.1 Biconnected components", The Design and Analysis of Algorithms, Texts and Monographs in Computer Science, New York: Springer-Verlag, pp. 20–22, doi:10.1007/978-1-4612-4400-4, ISBN 0-387-97687-6, MR 1139767, S2CID 27747202, archived from the original on 2022-01-08, retrieved 2022-01-08
  • Cioabă, Sebastian M. (2011), "Some applications of eigenvalues of graphs", in Dehmer, Matthias (ed.), Structural Analysis of Complex Networks, New York: Birkhäuser/Springer, pp. 357–379, doi:10.1007/978-0-8176-4789-6_14, ISBN 978-0-8176-4788-9, MR 2777924; see proof of Lemma 5, p. 361 Archived 2022-01-08 at the Wayback Machine
  • Skiena, Steven (2008), "6.1.2 Kruskal's Algorithm", The Algorithm Design Manual, Springer, pp. 196–198, Bibcode:2008adm..book.....S, doi:10.1007/978-1-84800-070-4, ISBN 978-1-84800-069-8, archived from the original on 2022-01-07, retrieved 2022-01-07
  • Cohen, Reuven; Havlin, Shlomo (2010), "10.1 Percolation on complex networks: Introduction", Complex Networks: Structure, Robustness and Function, Cambridge University Press, pp. 97–98, ISBN 978-1-139-48927-0, archived from the original on 2022-01-10, retrieved 2022-01-10

code.google.com

  • Joyner, David; Nguyen, Minh Van; Phillips, David (May 10, 2013), "1.6.1 Union, intersection, and join", Algorithmic Graph Theory and Sage (0.8-r1991 ed.), Google, pp. 34–35, archived from the original on January 16, 2016, retrieved January 8, 2022

doi.org

harvard.edu

ui.adsabs.harvard.edu

jstor.org

monash.edu

users.monash.edu

proquest.com

  • Bengelloun, Safwan Abdelmajid (December 1982), Aspects of Incremental Computing (PhD thesis), Yale University, p. 12, ProQuest 303248045

psu.edu

citeseerx.ist.psu.edu

semanticscholar.org

api.semanticscholar.org

stanford.edu

cs.stanford.edu

web.archive.org