Drum eulerian (Romanian Wikipedia)
Analysis of information sources in references of the Wikipedia article "Drum eulerian" in Romanian language version.
refsWebsite
Global rank
Romanian rank
3rd place
6th place
43rd place
2nd place
942nd place
1,192nd place
18th place
27th place
anu.edu.au
cs.anu.edu.au
- Brendan McKay(d) and Robert W. Robinson, Asymptotic enumeration of eulerian circuits in the complete graph, Combinatorica(d), 10 (1995), no. 4, 367–377.
books.google.com
- V. K. Balakrishnan, Schaum's Outline of Graph Theory: Including Hundreds of Solved Problems, p. 60, pe Google Books.
- Fleury, M. (), „Deux problèmes de Géométrie de situation”, Journal de mathématiques élémentaires, 2nd ser. (în franceză), 2: 257–261.
- Komjáth, Peter (), „Erdős's work on infinite graphs”, Erdös centennial, Bolyai Soc. Math. Stud., 25, János Bolyai Math. Soc., Budapest, pp. 325–345, doi:10.1007/978-3-642-39286-3_11
- Bollobás, Béla (), Modern graph theory, Graduate Texts in Mathematics, 184, Springer-Verlag, New York, p. 20, doi:10.1007/978-1-4612-0619-4, ISBN 0-387-98488-7.
doi.org
doi.org
- C. L. Mallows, N. J. A. Sloane (). „Two-graphs, switching classes and Euler graphs are equal in number”. SIAM Journal on Applied Mathematics(d). 28 (4): 876–880. doi:10.1137/0128070. JSTOR 2100368.
- Schrijver, Alexander (), „Bounds on the number of Eulerian orientations”, Combinatorica, 3 (3-4): 375–380, doi:10.1007/BF02579193.
- Pevzner, Pavel A.; Tang, Haixu; Waterman, Michael S. (). „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. doi:10.1073/pnas.171285098. PMC 55524
. PMID 11504945. - Roy, Kuntal (). „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 (). „An efficient parallel biconnectivity algorithm”. SIAM Journal on Computing. 14 (4): 862–874. doi:10.1137/0214061.
- Berkman, Omer; Vishkin, Uzi (). „Finding level-ancestors in trees”. J. Comput. Syst. Sci. 2. 48: 214–230. doi:10.1016/S0022-0000(05)80002-9.
- Komjáth, Peter (), „Erdős's work on infinite graphs”, Erdös centennial, Bolyai Soc. Math. Stud., 25, János Bolyai Math. Soc., Budapest, pp. 325–345, doi:10.1007/978-3-642-39286-3_11
- Bollobás, Béla (), Modern graph theory, Graduate Texts in Mathematics, 184, Springer-Verlag, New York, p. 20, doi:10.1007/978-1-4612-0619-4, ISBN 0-387-98488-7.
dx.doi.org
- Berkman, Omer; Vishkin, Uzi (). „Finding level-ancestors in trees”. J. Comput. Syst. Sci. 2. 48: 214–230. doi:10.1016/S0022-0000(05)80002-9.
harvard.edu
adsabs.harvard.edu
- Pevzner, Pavel A.; Tang, Haixu; Waterman, Michael S. (). „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. doi:10.1073/pnas.171285098. PMC 55524 . PMID 11504945.
jstor.org
- C. L. Mallows, N. J. A. Sloane (). „Two-graphs, switching classes and Euler graphs are equal in number”. SIAM Journal on Applied Mathematics(d). 28 (4): 876–880. doi:10.1137/0128070. JSTOR 2100368.
nih.gov
ncbi.nlm.nih.gov
- Pevzner, Pavel A.; Tang, Haixu; Waterman, Michael S. (). „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. doi:10.1073/pnas.171285098. PMC 55524 . PMID 11504945.
pnas.org
- Pevzner, Pavel A.; Tang, Haixu; Waterman, Michael S. (). „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. doi:10.1073/pnas.171285098. PMC 55524 . PMID 11504945.
unizg.hr
cit.srce.unizg.hr
- Roy, Kuntal (). „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.
wikidata.org
- C. L. Mallows, N. J. A. Sloane (). „Two-graphs, switching classes and Euler graphs are equal in number”. SIAM Journal on Applied Mathematics(d). 28 (4): 876–880. doi:10.1137/0128070. JSTOR 2100368.
- Brightwell și Winkler(d), "Note on Counting Eulerian Circuits", 2004.
- Brendan McKay(d) and Robert W. Robinson, Asymptotic enumeration of eulerian circuits in the complete graph, Combinatorica(d), 10 (1995), no. 4, 367–377.