Avtomorfizem grafa (Slovenian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Avtomorfizem grafa" in Slovenian language version.

refsWebsite

Global rank Slovenian rank

8doi.org

2^nd place

5^th place

3worldcat.org

5^th place

10^th place

2web.archive.org

1^st place

2^nd place

2ams.org

451^st place

701^st place

1numdam.org

8,650^th place

low place

1zbmath.org

1,923^rd place

4,047^th place

1math.ca

low place

1wikipedia.org

low place

1uni-ulm.de

low place

7,158^th place

1anu.edu.au

942^nd place

853^rd place

1unibas.ch

low place

5,489^th place

1umich.edu

459^th place

248^th place

ams.org

mathscinet.ams.org

Frucht (1949). Frucht, Robert (1949), »Graphs of degree three with a given abstract group«, Canadian Journal of Mathematics, 1 (4): 365–378, doi:10.4153/CJM-1949-033-6, ISSN 0008-414X, MR 0032987, arhivirano iz prvotnega spletišča dne 6. julija 2011, pridobljeno 10. julija 2019
Lubiw (1981). Lubiw, Anna (1981), »Some NP-complete problems similar to graph isomorphism«, SIAM Journal on Computing, 10 (1): 11–21, doi:10.1137/0210002, MR 0605600

anu.edu.au

cs.anu.edu.au

McKay (1981). McKay, Brendan (1981), »Practical Graph Isomorphism« (PDF), Congressus Numerantium (v angleščini), 30: 45–87, pridobljeno 14. aprila 2011.

doi.org

Frucht (1949). Frucht, Robert (1949), »Graphs of degree three with a given abstract group«, Canadian Journal of Mathematics, 1 (4): 365–378, doi:10.4153/CJM-1949-033-6, ISSN 0008-414X, MR 0032987, arhivirano iz prvotnega spletišča dne 6. julija 2011, pridobljeno 10. julija 2019
Luks (1982). Luks, Eugene Michael (1982), »Isomorphism of graphs of bounded valence can be tested in polynomial time«, Journal of Computer and System Sciences, 25 (1): 42–65, doi:10.1016/0022-0000(82)90009-5
Mathon (1979). Mathon, R. (1979), »A note on the graph isomorphism counting problem«, Information Processing Letters, 8: 131–132, doi:10.1016/0020-0190(79)90004-8
Lubiw (1981). Lubiw, Anna (1981), »Some NP-complete problems similar to graph isomorphism«, SIAM Journal on Computing, 10 (1): 11–21, doi:10.1137/0210002, MR 0605600
Torán (2004). Torán, Jacobo (2004), »On the hardness of graph isomorphism« (PDF), SIAM Journal on Computing, 33 (5): 1093–1108, doi:10.1137/S009753970241096X, arhivirano iz prvotnega spletišča (PDF) dne 20. novembra 2008, pridobljeno 10. julija 2019
Di Battista; Tamassia; Tollis (1992). Di Battista, Giuseppe; Tamassia, Roberto; Tollis, Ioannis G. (1992), »Area requirement and symmetry display of planar upward drawings«, Discrete and Computational Geometry, 7 (1): 381–401, doi:10.1007/BF02187850
Eades; Lin (2000). Eades, Peter; Lin, Xuemin (2000), »Spring algorithms and symmetry«, Theoretical Computer Science, 240 (2): 379–405, doi:10.1016/S0304-3975(99)00239-X
Hong (2002). Hong, Seok-Hee (2002), »Drawing graphs symmetrically in three dimensions«, Proc. 9th Int. Symp. Graph Drawing (GD 2001), Lecture Notes in Computer Science, zv. 2265, Springer-Verlag, str. 106–108, doi:10.1007/3-540-45848-4_16, ISBN 978-3-540-43309-5

math.ca

cms.math.ca

Frucht (1949). Frucht, Robert (1949), »Graphs of degree three with a given abstract group«, Canadian Journal of Mathematics, 1 (4): 365–378, doi:10.4153/CJM-1949-033-6, ISSN 0008-414X, MR 0032987, arhivirano iz prvotnega spletišča dne 6. julija 2011, pridobljeno 10. julija 2019

numdam.org

Frucht (1938). Frucht, Robert (1938), »Herstellung von Graphen mit vorgegebener abstrakter Gruppe«, Compositio Mathematica (v nemščini), 6: 239–250, ISSN 0010-437X, Zbl 0020.07804

umich.edu

eecs.umich.edu

Katebi; Sakallah; Markov (2010). Katebi, Hadi; Sakallah, Karem; Markov, Igor L. (Julij 2010), »Symmetry and Satisfiability: An Update« (PDF), Proc. Satisfiability Symposium (SAT) (v angleščini).

uni-ulm.de

theorie.informatik.uni-ulm.de

Torán (2004). Torán, Jacobo (2004), »On the hardness of graph isomorphism« (PDF), SIAM Journal on Computing, 33 (5): 1093–1108, doi:10.1137/S009753970241096X, arhivirano iz prvotnega spletišča (PDF) dne 20. novembra 2008, pridobljeno 10. julija 2019

unibas.ch

ai.cs.unibas.ch

Junttila; Kaski (2007). Junttila, Tommi; Kaski, Petteri (2007), »Engineering an efficient canonical labeling tool for large and sparse graphs« (PDF), Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX07) (v angleščini).

web.archive.org

Frucht (1949). Frucht, Robert (1949), »Graphs of degree three with a given abstract group«, Canadian Journal of Mathematics, 1 (4): 365–378, doi:10.4153/CJM-1949-033-6, ISSN 0008-414X, MR 0032987, arhivirano iz prvotnega spletišča dne 6. julija 2011, pridobljeno 10. julija 2019
Torán (2004). Torán, Jacobo (2004), »On the hardness of graph isomorphism« (PDF), SIAM Journal on Computing, 33 (5): 1093–1108, doi:10.1137/S009753970241096X, arhivirano iz prvotnega spletišča (PDF) dne 20. novembra 2008, pridobljeno 10. julija 2019

wikipedia.org

de.wikipedia.org

Köbler; Schöning; Torán (1993). Köbler, Johannes; Schöning, Uwe; Torán, Jacobo (1993), Graph Isomorphism Problem: The Structural Complexity, Birkhäuser Verlag, ISBN 0-8176-3680-3, OCLC 246882287

worldcat.org

Frucht (1938). Frucht, Robert (1938), »Herstellung von Graphen mit vorgegebener abstrakter Gruppe«, Compositio Mathematica (v nemščini), 6: 239–250, ISSN 0010-437X, Zbl 0020.07804
Frucht (1949). Frucht, Robert (1949), »Graphs of degree three with a given abstract group«, Canadian Journal of Mathematics, 1 (4): 365–378, doi:10.4153/CJM-1949-033-6, ISSN 0008-414X, MR 0032987, arhivirano iz prvotnega spletišča dne 6. julija 2011, pridobljeno 10. julija 2019
Köbler; Schöning; Torán (1993). Köbler, Johannes; Schöning, Uwe; Torán, Jacobo (1993), Graph Isomorphism Problem: The Structural Complexity, Birkhäuser Verlag, ISBN 0-8176-3680-3, OCLC 246882287

zbmath.org

Frucht (1938). Frucht, Robert (1938), »Herstellung von Graphen mit vorgegebener abstrakter Gruppe«, Compositio Mathematica (v nemščini), 6: 239–250, ISSN 0010-437X, Zbl 0020.07804