Sign In

Login

Password

Forgot Password ? Sign Up

Intervallgraph (German Wikipedia)

Analysis of information sources in references of the Wikipedia article "Intervallgraph" in German language version.

refsWebsite
Global rank German rank
5zdb-katalog.de
123rd place
6th place
3doi.org
2nd place
3rd place
2acm.org
1,185th place
2,009th place
2sciencedirect.com
149th place
298th place
1nih.gov
4th place
7th place
1msp.org
low place
low place
1apa.org
1,220th place
2,215th place
1aaai.org
9,352nd place
low place
1zbmath.org
1,923rd place
low place
1math.ca
low place
low place
1projecteuclid.org
3,707th place
5,342nd place
1infona.pl
low place
low place

aaai.org (Global: 9,352nd place; German: low place)

acm.org (Global: 1,185th place; German: 2,009th place)

dl.acm.org

  • Martin Charles Golumbic, Ron Shamir: Complexity and algorithms for reasoning about time: A graph-theoretic approach. In: Journal of the ACM (JACM). 40. Jahrgang, Nr. 5, 1993, S. 1108–1133 (englisch, acm.org).
  • Richard M. Karp: Mapping the genome: some combinatorial problems arising in molecular biology. twenty-fifth annual ACM symposium on Theory of computing. In: Proceedings of the twenty-fifth annual ACM symposium on Theory of computing. ACM, 1993, S. 278–285 (englisch, acm.org).

apa.org (Global: 1,220th place; German: 2,215th place)

psycnet.apa.org

  • Clyde H. Coombs, J. E. Smith: On the detection of structure in attitudes and developmental processes. In: Psychological Review. 80. Jahrgang, Nr. 5, 1973, S. 337 (englisch, apa.org).

doi.org (Global: 2nd place; German: 3rd place)

  • Wen-Lian Hsu, Kuo-Hui Tsai: Linear time algorithms on circular-arc graphs. In: Information Processing Letters. 40. Jahrgang, Nr. 3, 8. November 1991, ISSN 0020-0190, S. 123–129, doi:10.1016/0020-0190(91)90165-E (englisch, sciencedirect.com).
  • P. C. Gilmore, A. J. Hoffman: A characterization of comparability graphs and of interval graphs. In: Canadian Journal of Mathematics. 16. Jahrgang, Nr. 0, 1. Januar 1964, ISSN 1496-4279, S. 539–548, doi:10.4153/CJM-1964-055-5 (englisch, math.ca).
  • Kellogg S. Booth, George S. Lueker: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. In: Journal of Computer and System Sciences. 13. Jahrgang, Nr. 3, 1. Dezember 1976, ISSN 0022-0000, S. 335–379, doi:10.1016/S0022-0000(76)80045-1 (englisch, sciencedirect.com [abgerufen am 21. November 2015]).

infona.pl (Global: low place; German: low place)

  • C. Lekkeikerker, J. Boland: Representation of a finite graph by a set of intervals on the real line. In: Fundamenta Mathematicae. 1. Jahrgang, Nr. 51, 1962, ISSN 0016-2736, S. 45–64 (englisch, infona.pl).

math.ca (Global: low place; German: low place)

cms.math.ca

  • P. C. Gilmore, A. J. Hoffman: A characterization of comparability graphs and of interval graphs. In: Canadian Journal of Mathematics. 16. Jahrgang, Nr. 0, 1. Januar 1964, ISSN 1496-4279, S. 539–548, doi:10.4153/CJM-1964-055-5 (englisch, math.ca).

msp.org (Global: low place; German: low place)

  • David Kendall: Incidence matrices, interval graphs and seriation in archeology. In: Pacific Journal of mathematics. 28. Jahrgang, Nr. 3, 1969, S. 565–570 (englisch, msp.org).

nih.gov (Global: 4th place; German: 7th place)

ncbi.nlm.nih.gov

projecteuclid.org (Global: 3,707th place; German: 5,342nd place)

  • D. R. Fulkerson, O. A. Gross: Incidence matrices and interval graphs. In: Pacific Journal of Mathematics. 15. Jahrgang, Nr. 3, 1965, ISSN 0030-8730, S. 835–855 (englisch, projecteuclid.org).

sciencedirect.com (Global: 149th place; German: 298th place)

zbmath.org (Global: 1,923rd place; German: low place)

  • Martin Charles Golumbic: Algorithmic graph theory and perfect graphs. 1980 (englisch, zbmath.org).

zdb-katalog.de (Global: 123rd place; German: 6th place)

  • Wen-Lian Hsu, Kuo-Hui Tsai: Linear time algorithms on circular-arc graphs. In: Information Processing Letters. 40. Jahrgang, Nr. 3, 8. November 1991, ISSN 0020-0190, S. 123–129, doi:10.1016/0020-0190(91)90165-E (englisch, sciencedirect.com).
  • P. C. Gilmore, A. J. Hoffman: A characterization of comparability graphs and of interval graphs. In: Canadian Journal of Mathematics. 16. Jahrgang, Nr. 0, 1. Januar 1964, ISSN 1496-4279, S. 539–548, doi:10.4153/CJM-1964-055-5 (englisch, math.ca).
  • Kellogg S. Booth, George S. Lueker: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. In: Journal of Computer and System Sciences. 13. Jahrgang, Nr. 3, 1. Dezember 1976, ISSN 0022-0000, S. 335–379, doi:10.1016/S0022-0000(76)80045-1 (englisch, sciencedirect.com [abgerufen am 21. November 2015]).
  • D. R. Fulkerson, O. A. Gross: Incidence matrices and interval graphs. In: Pacific Journal of Mathematics. 15. Jahrgang, Nr. 3, 1965, ISSN 0030-8730, S. 835–855 (englisch, projecteuclid.org).
  • C. Lekkeikerker, J. Boland: Representation of a finite graph by a set of intervals on the real line. In: Fundamenta Mathematicae. 1. Jahrgang, Nr. 51, 1962, ISSN 0016-2736, S. 45–64 (englisch, infona.pl).