Párosítás (Hungarian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Párosítás" in Hungarian language version.

refsWebsite

Global rank Hungarian rank

8doi.org

2^nd place

8^th place

1mimuw.edu.pl

low place

1kth.se

low place

1tugraz.at

low place

doi.org

dx.doi.org

Fredman, Michael L. & Tarjan, Robert Endre (1987), "Fibonacci heaps and their uses in improved network optimization algorithms", Journal of the ACM 34 (3): 596–615, DOI 10.1145/28869.28874
Micali, S. & Vazirani, V. V. (1980), "An $\scriptstyle O({\sqrt {|V|}}\cdot |E|)$ algorithm for finding maximum matching in general graphs", Proc. 21st IEEE Symp. Foundations of Computer Science, pp. 17–27, DOI 10.1109/SFCS.1980.12.
Yannakakis, Mihalis & Gavril, Fanica (1980), "Edge dominating sets in graphs", SIAM Journal on Applied Mathematics 38 (3): 364–372, DOI 10.1137/0138030.
(2008) „Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems”. SIAM Journal on Computing 37 (5), 1429–1454. o. DOI:10.1137/050644033.
Tichy, Robert F. & Wagner, Stephan (2005), "Extremal problems for topological indices in combinatorial chemistry", Journal of Computational Biology 12 (7): 1004–1013, doi:10.1089/cmb.2005.12.1004, <http://www.math.tugraz.at/fosp/pdfs/tugraz_main_0052.pdf>.
Rabin, Michael O. & Vazirani, Vijay V. (1989), "Maximum matchings in general graphs through randomization", J. of Algorithms 10: 557–567, DOI 10.1016/0196-6774(89)90005-9.
Tassa, Tamir (2012), "Finding all maximally-matchable edges in a bipartite graph", Theoretical Computer Science 423: 50–58, DOI 10.1016/j.tcs.2011.12.071.
Lásd pl. Trinajstić, Nenad; Klein, Douglas J. & Randić, Milan (1986), "On some solved and unsolved problems of chemical graph theory", International Journal of Quantum Chemistry 30 (S20): 699–742, DOI 10.1002/qua.560300762.

kth.se

nada.kth.se

Ausiello, Giorgio; Crescenzi, Pierluigi & Gambosi, Giorgio et al. (2003), Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties, Springer. Minimum edge dominating set (optimisation version) is the problem GT3 in Appendix B (page 370). Minimum maximal matching (optimisation version) is the problem GT10 in Appendix B (page 374). See also Minimum Edge Dominating Set and Minimum Maximal Matching in the web compendium.

mimuw.edu.pl

Mucha, M. & Sankowski, P. (2004), "Maximum Matchings via Gaussian Elimination", Proc. 45th IEEE Symp. Foundations of Computer Science, pp. 248–255

tugraz.at

math.tugraz.at

Tichy, Robert F. & Wagner, Stephan (2005), "Extremal problems for topological indices in combinatorial chemistry", Journal of Computational Biology 12 (7): 1004–1013, doi:10.1089/cmb.2005.12.1004, <http://www.math.tugraz.at/fosp/pdfs/tugraz_main_0052.pdf>.