The algorithmic use of hypertree structure and maximum neighbourhood orderings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 903, Issue , 1995, Pages 65-80

  Brandstädt, Andreas ^a   Chepoi, Victor D ^b   Dragan, Feodor F ^b  

^a UNIVERSITY OF DUISBURG ESSEN   (Germany)

^b MOLDOVA STATE UNIVERSITY   (Moldova)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHIC METHODS;

CORRESPONDING VERTICES; DUALLY CHORDAL GRAPHS; GRAPH ALGORITHMS; HYPERTREE STRUCTURE; RELATIONAL DATABASE; STRONGLY CHORDAL GRAPH; STRUCTURE PROPERTY; TREE STRUCTURES;

TREES (MATHEMATICS);

EID: 84947935507     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-59071-4_38     Document Type: Conference Paper

References (31)

1. H. Behrendt and A. Brandstädt, Domination and the use of maximum neighbourhoods, Technical Report SM-DU-204, University of Duisburg 1992
2. C. Berge, Hypergraphs, North Holland, 1989
3. A. Brandstädt, F.F. Dragan, V.D. Chepoi, and V.I. Voloshin, Dually chordal graphs, Technical Report SM-DU-225, University of Duisburg 1993, Graph-Theoretic Concepts in Computer Science, 19th International Workshop WG’93, Utrecht, The Netherlands, LNCS 790, Springer, Jan van Leeuwen (Ed.), 237-251
4. A. Brandstädt, V.D. Chepoi, and F.F. Dragan, The algorithmic use of hypertree structure and maximum neighbourhood orderings, Technical Report SM-DU 244, University of Duisburg 1994, submitted to Theor. Comp. Science
5. P. Buneman, A characterization of rigid circuit graphs, Discr. Math. 9 (1974), 205-212
6. R. Chandrasekaran and A. Doughety, Location on tree networks: p-center and q-dispersion problems, Math. Oper. Res. 1981, 6, No. 1, 50-57
7. G.J. Chang, Labeling algorithms for domination problems in sun-free chordal graphs, Discrete Applied Mathematics 22 (1988/89), 21-34
8. G.J. Chang and G.L. Nemhauser, The k-domination and k-stability problems on sun-free chordal graphs, SIAM J. Algebraic and Discrete Methods 5 (1984), 332-345
9. G.J. Chang and G.L. Nemhauser, Covering, Packing and Generalized Perfection, SIAM J. Algebraic and Discrete Methods 6 (1985), 109-132
10. F.F. Dragan, Dominating and packing in triangulated graphs (in Russian), Meth. of Discr. Analysis (Novosibirsk) 51 (1991), 17-36
11. F.F. Dragan, HT-graphs: centers, connected 1-domination and Steiner trees, Computer Science Journal of Moldova, 1993, Vol. 1, No. 2, 64-83
12. F.F. Dragan, Domination in Helly graphs without quadrangles (in Russian) Cybernetics and System Analysis (Kiev) 6 (1993)
13. F. F. Dragan, and A. BrandstÄdt, r-Dominating cliques in Helly graphs and chordal graphs, Technical Report SM-DU-228, University of Duisburg 1993, Proc. of the 11th STACS, Caen, France, Springer, LNCS 775, 735-746, 1994
14. F. F. Dragan, C. F. Prisacaru, and V. D. Chepoi, Location problems in graphs and the Helly property (in Russian), Discrete Mathematics, Moscow, 4 (1992), 67-73 (the full version appeared as preprint: F.F. Dragan, C.F. Prisacaru, and V.D. Chepoi, r-Domination and p-center problems on graphs: special solution methods and graphs for which this method is usable (in Russian), Kishinev State University, preprint MoldNIINTI, N. 948-M88, 1987)
15. M. Farber, Domination, Independent Domination and Duality in Strongly Chordal Graphs, Discr. Appl. Math. 7 (1984), 115-130
16. G.N. Frederickson, Parametric search and locating supply centers in trees, Proc. Workshop on Algorithms and Data Structures (WADS’91), Springer, LNCS 519, 1991, 299-319
17. Y. Gurevich, L. Stockmeyer and U. Vishkin, Solving NP hard problems on graphs that are almost trees and an application to facility location problems, J. ACM 31 (1984), 459-473
18. S.C. Hedetniemī and R. Laskar, (eds.), Topics on Domination, Annals of Discr. Math. 48, North-Holland, 1991
19. O. Kariv and S.L. Hakimi, An algorithmic approach to network location problems, I: the p-centers, SIAM J. Appl. Math. 1979, 37, No. 3, 513-538
20. A.W.J. Kolen, Duality in tree location theory, Cah. Cent. Etud. Rech. Oper., 25 (1983), 201-215
21. A. Lubiw, Doubly lexical orderings of matrices, SIAM J. Comput. 16 (1987), 854-879.
22. 2n) algorithm for the k-th longest path in a tree with applications to location problems, SIAM J. Comput. 10 (1981), 328-337
23. M. Moscarini, Doubly chordal graphs, Steiner trees and connected domination, Networks 23 (1993), 59-69
24. R. Paige and R.E. Tarjan, Three partition refinement algorithms, SIAM J. Comput. 16 (1987), 973-989
25. J. Plesnik, A heuristic for the p-center problem in graphs, Discr. Math. 17 (1987), 263-268
26. P.J. Slater, R-domination in graphs, J. ACM 23 (1976), 446-450
27. J.P. Spinrad, Doubly lexical ordering of dense 0-1-matrices, manuscript 1988, to appear in SIAM J. Comput.
28. J.L. Szwarcfiter and C.F. Bornstein, Clique graphs of chordal and path graphs, manuscript 1992, to appear in SIAM J. Discr. Math.
29. B. Tansel, R. Francis and T. Lowe, Location on networks: a survey I, II, Management Sci. 29 (1983), 482-511
30. R.E. Tarjan and M. Yannakakis, Simple linear time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs, SIAM J. Comput. 13, 3 (1984), 566-579
31. K. White, M. Farber and W. Pulleyblank, Steiner Trees, Connected Domination and Strongly Chordal Graphs, Networks 15 (1985), 109-124