The maximum K-dependent and F-dependent set problem

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

Volumn 762 LNCS, Issue , 1993, Pages 88-97

  Dessmark, Anders ^a   Jansen, Klaus ^b   Lingas, Andrzej ^a  

^a LUND UNIVERSITY   (Sweden)

^b UNIVERSITY OF DUISBURG ESSEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 70349348771     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-57568-5_238     Document Type: Conference Paper

References (15)

1. H.L. Bodlaender: A linear time algorithm for finding tree-decompositions of small treewidth, Proceedings of 25th STOC, 1993.
2. H.L. Bodlaender: NC-algorithms for graphs with small treewidth, Proceedings of WG 88, Amsterdam, Netherlands (1988), Springer Verlag, LNCS 344, 1-8.
3. S. Carlsson, Y. Igarashi, K. Kanai, A. Lingas, K. Miura, O. Petersson: Information disseminating schemes for fault tolerance in hypercubes, IEICE Trans. Fundamentals 75, 1992, 255-260.
4. D.G. Corneil, Y. Perl and L.K. Stewart: A linear recognition algorittnn for cographs, SIAM d. Comput. 14, 1985, 926-934.
5. A. Dessmark, K. Jansen, A. Lingas: The complexity of maximum k-dependent and f-dependent set, Technical Report, LU-CS-TR:93-119, Dept. Computer Science, Lund University, Sweden, 1993.
6. H. Djidjev, O. Garrido, C. Levcopoulos, A. Lingas: On the maximum k-dependent set problem, Technical Report, LU-CS-TR:92-91, Dept. Computer Science, Lund University, Sweden, 1992.
7. K. Diks, O. Garrido, A. Lingas: Parallel algorithms for finding maximal kdependent sets and maximal f-matchings, Proceedings of ISA 91, Taipei, Taiwan (1991), Springer Verlag, LNCS 557, 385-395.
8. M.C. Golumbic: Algorithmic graph theory and perfect graphs, Academic Press, New York, 1980.
9. X. He: Parallel Mgorithm for cograph recognition with applications, Proceedings of SWAT’92, Helsinki, Finland, Springer Verlag, LNCS 621, 94-105.
10. J.E. Hoperoft and R.M. Karp: An n 2s Mgorithm for maximum matching in bipartite graphs, SIAM J. Comp. 2 (1973), 225-231.
11. P.L. Hammer, B. Simeone: The splittance of a graph, Combinatorica 1 (3), 1981, 275-284.
12. R.M. Karp and V. Ramachandran: Parallel algorithms for shared memory machines, J. van Leeuwen, ed., Handbook of Theoretical Computer Science, Vol. A (Elsevier Science Publishers, Amsterdam, 1990) 869-941.
13. S.R. Kosaraju and A.L. Delcher: Optimal parallel evaluation of treestructured computation by ranking (extended abstract), Proc. AWOC 88, Springer-Verlag, N.Y., 1988, LNCS 319, 101-111.
14. J. Lagergren: Efficient Parallel Algorithms for Tree-Decomposition and Related Problems. Proc. 31st FOCS, 1990.
15. C.H. Papadimitriou and K. Steiglitz: Combinatorial Optimization, Algorithms and Complexity, Prentice-Hall, New Jersey, 1982.