Ојлеров пут (Serbian Wikipedia)
Analysis of information sources in references of the Wikipedia article "Ојлеров пут" in Serbian language version.
refsWebsite
Global rank
Serbian rank
3rd place
2nd place
11th place
23rd place
6th place
5th place
low place
low place
942nd place
2,000th place
18th place
28th place
ams.org
- Schrijver, A. (1983), „Bounds on the number of Eulerian orientations”, Combinatorica, 3 (3–4): 375—380, MR 729790, S2CID 13708977, doi:10.1007/BF02579193
anu.edu.au
cs.anu.edu.au
- Brendan McKay and Robert W. Robinson, Asymptotic enumeration of eulerian circuits in the complete graph, Combinatorica, 10 (1995), no. 4, 367–377.
archive.org
- N. L. Biggs; E. K. Lloyd; R. J. Wilson (1976). Graph Theory 1736–1936. Oxford: Clarendon Press. стр. 8–9. ISBN 978-0-19-853901-8.
books.google.com
- Schaum's outline of theory and problems of graph theory By V. K. Balakrishnan [1].
- Fleury, M. (1883), „Deux problèmes de Géométrie de situation”, Journal de mathématiques élémentaires, 2nd ser. (на језику: French), 2: 257—261
cwi.nl
ir.cwi.nl
- Schrijver, A. (1983), „Bounds on the number of Eulerian orientations”, Combinatorica, 3 (3–4): 375—380, MR 729790, S2CID 13708977, doi:10.1007/BF02579193
doi.org
- C. L. Mallows, N. J. A. Sloane (1975). „Two-graphs, switching classes and Euler graphs are equal in number”. SIAM Journal on Applied Mathematics. 28 (4): 876—880. JSTOR 2100368. doi:10.1137/0128070.
- Schrijver, A. (1983), „Bounds on the number of Eulerian orientations”, Combinatorica, 3 (3–4): 375—380, MR 729790, S2CID 13708977, doi:10.1007/BF02579193
- Pevzner, Pavel A.; Tang, Haixu; Waterman, Michael S. (2001). „An Eulerian trail approach to DNA fragment assembly”. Proceedings of the National Academy of Sciences of the United States of America. 98 (17): 9748—9753. Bibcode:2001PNAS...98.9748P. PMC 55524
. PMID 11504945. doi:10.1073/pnas.171285098 . - Roy, Kuntal (2007). „Optimum Gate Ordering of CMOS Logic Gates Using Euler Path Approach: Some Insights and Explanations”. Journal of Computing and Information Technology. 15 (1): 85—92. doi:10.2498/cit.1000731.
- Tarjan, Robert E.; Vishkin, Uzi (1985). „An efficient parallel biconnectivity algorithm”. SIAM Journal on Computing. 14 (4): 862—874. S2CID 7231609. doi:10.1137/0214061.
- Berkman, Omer; Vishkin, Uzi (1994). „Finding level-ancestors in trees”. J. Comput. Syst. Sci. 2. 48 (2): 214—230. doi:10.1016/S0022-0000(05)80002-9.
harvard.edu
adsabs.harvard.edu
- Pevzner, Pavel A.; Tang, Haixu; Waterman, Michael S. (2001). „An Eulerian trail approach to DNA fragment assembly”. Proceedings of the National Academy of Sciences of the United States of America. 98 (17): 9748—9753. Bibcode:2001PNAS...98.9748P. PMC 55524 . PMID 11504945. doi:10.1073/pnas.171285098 .
jstor.org
- C. L. Mallows, N. J. A. Sloane (1975). „Two-graphs, switching classes and Euler graphs are equal in number”. SIAM Journal on Applied Mathematics. 28 (4): 876—880. JSTOR 2100368. doi:10.1137/0128070.
nih.gov
ncbi.nlm.nih.gov
- Pevzner, Pavel A.; Tang, Haixu; Waterman, Michael S. (2001). „An Eulerian trail approach to DNA fragment assembly”. Proceedings of the National Academy of Sciences of the United States of America. 98 (17): 9748—9753. Bibcode:2001PNAS...98.9748P. PMC 55524 . PMID 11504945. doi:10.1073/pnas.171285098 .
semanticscholar.org
api.semanticscholar.org
- Schrijver, A. (1983), „Bounds on the number of Eulerian orientations”, Combinatorica, 3 (3–4): 375—380, MR 729790, S2CID 13708977, doi:10.1007/BF02579193
- Tarjan, Robert E.; Vishkin, Uzi (1985). „An efficient parallel biconnectivity algorithm”. SIAM Journal on Computing. 14 (4): 862—874. S2CID 7231609. doi:10.1137/0214061.
unizg.hr
cit.srce.unizg.hr
- Roy, Kuntal (2007). „Optimum Gate Ordering of CMOS Logic Gates Using Euler Path Approach: Some Insights and Explanations”. Journal of Computing and Information Technology. 15 (1): 85—92. doi:10.2498/cit.1000731.
wikipedia.org
en.wikipedia.org
- Schrijver, A. (1983), „Bounds on the number of Eulerian orientations”, Combinatorica, 3 (3–4): 375—380, MR 729790, S2CID 13708977, doi:10.1007/BF02579193