Pohon Interval Pada Persoalan Graph Interval

DAFTAR PUSTAKA

Anita, Pal, dan Pal, T.K. 2009. Interval Tree And Its Applications. International
Journal of Computer Mathematics. India : hal. 211-225.
Fulkerson, D. R. dan Gross, O. A. 1965. Incidence matrices and interval graphs.
Pacific J. Math. 15. 835-855.
Gilmore, P. C. dan Hoffman, A. J. 1964. A characterization of comparability graphs
and of interval graphs. J. Math. 16 Canad. 539-548.
Ghouila Houri, M. C. 1962. Characterization des graphes nonorients dont on peut
orienter les aretesl de maniere a obtenir le grape d’une relation d’orde. C. R.
Acad. Sci. Paris, 254, 1370-1371
Golumbic, M. C. 1980. Algorithmic Graph Theory and Perfect Graphs. New York :
Academic Press.
Hajos, G. 1957. Uber eine Art von Graphen, Fifst posed the problem of characterizing interval graphs. Intern. Math. Nachr. 11 Problem 65.
Lekkerkerker, C. G. dan Boland, J. C. 1962. Representation of a finite graph by a
set of intervals on the real line. Fund. Math. 51. 45-64.
Munir, R. 2005. Matematika Diskrit. Bandung: Informatika
Madanlal, M. S.,Venkatesan, G. dan Pandu R, C. 1996. Tree 3-spanners on interval,
permutation and regular bipartite graphs. Information Processing Letters. 59.
97-102.
Pal, M. dan Bhattacharjee, G. P. 1996. A sequential algorithm for finding a maximum weight k-independent set on interval graphs. Intern. J. Computer Maths.

60. 439-449.
Ramalingam, G. dan Pandu R, C. 1988. A unified approach to domination problem
in interval graphs, Information Processing Letters 27 271-274.

29
Universitas Sumatera Utara