Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Algorithms and Computation

ISAAC 1993: Algorithms and Computation pp 88–97Cite as

The maximum k-dependent and f-dependent set problem

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 762))

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H.L. Bodlaender: A linear time algorithm for finding tree-decompositions of small treewidth, Proceedings of 25th STOC, 1993.

    Google Scholar 

  2. H.L. Bodlaender: NC-algorithms for graphs with small treewidth, Proceedings of WG 88, Amsterdam, Netherlands (1988), Springer Verlag, LNCS 344, 1–8.

    Google Scholar 

  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.

    Google Scholar 

  4. D.G. Corneil, Y. Perl and L.K. Stewart: A linear recognition algorithm for cographs, SIAM J. Comput. 14, 1985, 926–934.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  7. 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.

    Google Scholar 

  8. M.C. Golumbic: Algorithmic graph theory and perfect graphs, Academic Press, New York, 1980.

    Google Scholar 

  9. X. He: Parallel algorithm for cograph recognition with applications, Proceedings of SWAT'92, Helsinki, Finland, Springer Verlag, LNCS 621, 94–105.

    Google Scholar 

  10. 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.

    Article  Google Scholar 

  11. P.L. Hammer, B. Simeone: The splittance of a graph, Combinatorica 1 (3), 1981, 275–284.

    Google Scholar 

  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.

    Google Scholar 

  13. 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.

    Google Scholar 

  14. J. Lagergren: Efficient Parallel Algorithms for Tree-Decomposition and Related Problems. Proc. 31st FOCS, 1990.

    Google Scholar 

  15. C.H. Papadimitriou and K. Steiglitz: Combinatorial Optimization, Algorithms and Complexity, Prentice-Hall, New Jersey, 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department Computer Science, Lund University, Box 118, 221 00, Lund, Sweden

    Anders Dessmark & Andrzej Lingas

  2. Fachbereich 11, Informatik, Universität Duisburg, 47048, Duisburg, Germany

    Klaus Jansen

Authors
  1. Anders Dessmark
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Klaus Jansen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Andrzej Lingas
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

K. W. Ng P. Raghavan N. V. Balasubramanian F. Y. L. Chin

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation