On improved time bounds for permutation graph problems

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

Volumn 657 LNCS, Issue , 1993, Pages 1-10

  Brandstädt, Andreas ^a  

^a UNIVERSITY OF DUISBURG ESSEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMIC PROGRAMMING; POLYNOMIAL APPROXIMATION;

FEEDBACK VERTEX SET; GEOMETRIC REPRESENTATION; INTERSECTION MODEL; MINIMUM WEIGHT; PERMUTATION GRAPH; POLYNOMIAL-TIME; SHORTEST PATH PROBLEM; TIME BOUND;

GRAPH THEORY;

EID: 0001959753     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-56402-0_30     Document Type: Conference Paper

References (20)

1. K. Arvind, C. Pandu Rangan: Connected domination and Steiner set on weighted permutation graphs, IPL 41 (1992) 1215-220.
2. M.J. Atallah, S. Kosaraju: An Efficient Algorithm for Maxdominance with Applications, Algorithmica (1989) 4, 221-236.
3. M.J. Atallah, G.K. Manacher, J. Urrutia: Finding a minimum independent dominating set in a permutation graph, Discrete Applied Math., Vol 21, 177-183, 1988.
4. A. Brandsädt, D. Kratsch: On the restriction of some NP-complete graph problems to permutation graphs, L. Budach, ed., Proc. FCT 1985, Lecture Notes in Computer Science 199 (1985) 53-62, Forerg. FSU Jena, N/84/80, 1984.
5. A. Brandsädt, D. Kratsch: On domination problems for permutation and other graphs, Theoretical Computer Science 54, 1987, 181-198.
6. C.J. Colbourn, L.K. Stewart: Permutation graphs: connected domination and Steiner trees, Topics on Domination, Annals of Discrete Mathematics 48 (Eds.: S.T. Hedetniemi, R.C. Laskar), 1990, 179-190.
7. D.G. Corneill L.K. Stewart: Dominating sets in Perfect Graphs, Topics on Domination, Annals of Discrete Mathematics 48, 145-164.
8. S. Even, A. Pnueli, A. Lempel: Permutation graphs and transitive graphs, 3. ACM, Vol 19, 400-410, 1972.
9. M. Farber, J.M. Keil: Domination in permutation graphs, J. Algorithms, Vol 6, 309-321, 1985.
10. V. Kamakoti, D. Kratsch, R. Mahesh, C. Pandu Rangan: A Unified Approach to Efficient Algorithms on weighted Permutation Graphs, manuscript 1991.
11. V. Kamakoti, C. Pandu Rangan: Efficient Transitive Reduction of Permutation graphs and its Applications, manuscript 1991.
12. H. Kim: Finding a maximum independent set in a permutation graph, Inf. Proc. Letters 36 (1990) 19-23.
13. E.L. Lawler: Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York 1976.
14. Y. Liang, C. Rhee, S.K. Dhall, S. Lakshmivarahan: A new approach for the domination problem on permutation graphs, Inf. Proc. Letters 37 (1991) 219-224.
15. G.K. Manacher, C.J. Smith, Efficient algorithms for new problems on interval graphs and interval models, manuscript, 1984.
16. A. Srinivasan, C. Pandu Rangan: Efficient algorithms for the minimum weighted dominating clique problem on permutation graphs, Theor. Comp. Sci. 91 (1991), 1-21.
17. A. Pnueli, A. Lempel, S. Even: Transitive orientation of graphs and identification of permutation graphs”, Canad. J. Math., Vol 23 (1971), 160-175.
18. J. Spinrad: On comparability and permutation graphs, SIAM 3. Comput., Vol 14, 658-670, 1985.
19. J. Spinrad, A. Brandstädt, L. Stewart: Bipartite permutation graphs, Discrete Applied Math., Vol 18, 279-292, 1987.
20. K.H. Tsai, W.L. Hsu: Fast algorithms for the dominating set problem on permutation graphs, Internat. Sympos. SIGAL 1990, Lect. Notes in Comp. Sci. 450, 109-117.