Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
H.L. Bodlaender: A linear time algorithm for finding tree-decompositions of small treewidth, Proceedings of 25th STOC, 1993.
H.L. Bodlaender: NC-algorithms for graphs with small treewidth, Proceedings of WG 88, Amsterdam, Netherlands (1988), Springer Verlag, LNCS 344, 1–8.
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.
D.G. Corneil, Y. Perl and L.K. Stewart: A linear recognition algorithm for cographs, SIAM J. Comput. 14, 1985, 926–934.
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.
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.
K. Diks, O. Garrido, A. Lingas: Parallel algorithms for finding maximal k-dependent sets and maximal f-matchings, Proceedings of ISA 91, Taipei, Taiwan (1991), Springer Verlag, LNCS 557, 385–395.
M.C. Golumbic: Algorithmic graph theory and perfect graphs, Academic Press, New York, 1980.
X. He: Parallel algorithm for cograph recognition with applications, Proceedings of SWAT'92, Helsinki, Finland, Springer Verlag, LNCS 621, 94–105.
J.E. Hopcroft and R.M. Karp: An n 2.5 algorithm for maximum matching in bipartite graphs, SIAM J. Comp. 2 (1973), 225–231.
P.L. Hammer, B. Simeone: The splittance of a graph, Combinatorica 1 (3), 1981, 275–284.
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.
S.R. Kosaraju and A.L. Delchen Optimal parallel evaluation of treestructured computation by ranking (extended abstract), Proc. AWOC 88, Springer-Verlag, N.Y., 1988, LNCS 319, 101–111.
J. Lagergren: Efficient Parallel Algorithms for Tree-Decomposition and Related Problems. Proc. 31st FOCS, 1990.
C.H. Papadimitriou and K. Steiglitz: Combinatorial Optimization, Algorithms and Complexity, Prentice-Hall, New Jersey, 1982.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dessmark, A., Jansen, K., Lingas, A. (1993). The maximum k-dependent and f-dependent set problem. In: Ng, K.W., Raghavan, P., Balasubramanian, N.V., Chin, F.Y.L. (eds) Algorithms and Computation. ISAAC 1993. Lecture Notes in Computer Science, vol 762. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57568-5_238
Download citation
DOI: https://doi.org/10.1007/3-540-57568-5_238
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57568-9
Online ISBN: 978-3-540-48233-8
eBook Packages: Springer Book Archive