Kétszeresen összefüggő komponens (Hungarian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Kétszeresen összefüggő komponens" in Hungarian language version.

refsWebsite
Global rank Hungarian rank
2nd place
8th place

doi.org

dx.doi.org

  • (1973) „Algorithm 447: efficient algorithms for graph manipulation”. Communications of the ACM 16 (6), 372–378. o. DOI:10.1145/362248.362272.  
  • Schmidt, Jens M. (2013), "A Simple Test on 2-Vertex- and 2-Edge-Connectivity", Information Processing Letters 113 (7): 241–244, DOI 10.1016/j.ipl.2013.01.016.
  • (1992) „Maintaining bridge-connected and biconnected components on-line”. Algorithmica 7, 433–464. o. DOI:10.1007/BF01758773.  
  • (1985) „An Efficient Parallel Biconnectivity Algorithm”. SIAM J. Comput. 14 (4), 862–874. o. DOI:10.1137/0214061.  
  • Guojing Cong and David A. Bader, (2005). „An Experimental Study of Parallel Biconnected Components Algorithms on Symmetric Multiprocessors (SMPs)”. Proceedings of the 19th IEEE International Conference on Parallel and Distributed Processing Symposium: 45b. doi:10.1109/IPDPS.2005.100. 
  • Better speedups using simpler parallel programming for graph connectivity and biconnectivity, Proceedings of the 2012 International Workshop on Programming Models and Applications for Multicores and Manycores - PMAM '12, 103. o.. DOI: 10.1145/2141702.2141714 (2012). ISBN 9781450312110