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

123^rd place

6^th place

3doi.org

2^nd place

3^rd place

2acm.org

1,185^th place

2,009^th place

2sciencedirect.com

149^th place

298^th place

1nih.gov

4^th place

7^th place

1msp.org

low place

1apa.org

1,220^th place

2,215^th place

1aaai.org

9,352^nd place

low place

1zbmath.org

1,923^rd place

low place

1math.ca

low place

1projecteuclid.org

3,707^th place

5,342^nd place

1infona.pl

low place

aaai.org

Jürgen Dorn: Temporal reasoning in sequence graphs. 10th National Conference on Artificial Intelligence (AAAI 92). In: AAAI-92 : proceedings / tenth National Conference on Artificial Intelligence, July 12-16, 1992. American Association for Artificial Intelligence, Menlo Park, CA 1992, S. 735–740 (englisch, aaai.org [PDF]).

acm.org

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

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

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

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

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

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

ncbi.nlm.nih.gov

Seymour Benzer: On the topology of the genetic fine structure. In: Proceedings of the National Academy of Sciences. 45. Jahrgang, Nr. 11, 1959, S. 1607, PMC 222769 (freier Volltext) – (englisch).

projecteuclid.org

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

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).
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]).

zbmath.org

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

zdb-katalog.de

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).