论文信息 - On interval graphs and matrice profiles

On interval graphs and matrice profiles

A l'aide d'une caracterisation des graphes d'intervalles par Tarjan, on demontre que le probleme de la minimisation du profil d'une matrice creuse et symetrique est NP-complet. On donne une nouvelle demonstration d'un resultat connu concernant un probleme du type de Turan sur un graphe d'intervalles. On etudie la decomposition d'un graphe en intersections de graphes d'intervalles et on considere les ordres chronologiques associes a un graphe d'intervalles

Alain Billionnet | A. Billionnet

[1] R. Möhring. Algorithmic graph theory and perfect graphs , 1986 .

[2] D. Rose. Triangulated graphs and the elimination process , 1970 .

[3] P. Gilmore,et al. A Characterization of Comparability Graphs and of Interval Graphs , 1964, Canadian Journal of Mathematics.

[4] Dale Skrien. Chronological orderings of interval graphs , 1984, Discret. Appl. Math..

[5] H. L. Abbott,et al. A Turán type problem for interval graphs , 1979, Discret. Math..

[6] J. Pasciak,et al. Computer solution of large sparse positive definite systems , 1982 .

[7] Gordon C. Everstine,et al. A comparasion of three resequencing algorithms for the reduction of matrix profile and wavefront , 1979 .

[8] M. Golumbic. CHAPTER 3 – Perfect Graphs , 1980 .

[9] William G. Poole,et al. An algorithm for reducing the bandwidth and profile of a sparse matrix , 1976 .

[10] A. George,et al. A Minimal Storage Implementation of the Minimum Degree Algorithm , 1980 .

[11] Hans S. Witsenhausen. On intersections of interval graphs , 1980, Discret. Math..

[12] R. Tarjan. Graph theory and Gaussian elimination. , 1975 .

[13] D. R. Fulkerson,et al. Incidence matrices and interval graphs , 1965 .

[14] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[15] M. Yannakakis. Computing the Minimum Fill-in is NP^Complete , 1981 .