Skip to main content
SpringerLink
Log in

Finding minimally weighted subgraphs

  • Graph Algorithms And Complexity
  • Conference paper
  • First Online:
Graph-Theoretic Concepts in Computer Science (WG 1990)

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

Included in the following conference series:

Abstract

Let H be a fixed graph of tree-width w. We study the problems of finding a minimally weighted weak H-subgraph, resp., a minimally weighted induced H-subgraph in an edge-weighted graph G on n nodes. We present an O(n w+1)-algorithm for the weak subgraph problem. If the maximal degree of G is bounded, the algorithm above can be modified to an O(n w+1)-algorithm for the induced subgraph problem.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Babai, L., Frankl, P. (1988): Linear algebra methods in combinatorics, Part 1. Preliminary Version (July 1988), University of Chicago

    Google Scholar 

  • Golumbic, M.Ch. (1980): Algorithmic graph theory and perfect graphs. Academic Press, New York

    Google Scholar 

  • Lovász, L. (1977): Flats in matroids and geometric graphs. In: Combinatorial surveys: Proc. 6th British Comb. Conf., pp. 45–86

    Google Scholar 

  • Monien, B. (1985): How to find long paths efficiently. Annals of Discrete Mathematics, Vol. 25, pp. 239–254

    Google Scholar 

  • Nešetřil, J., Poljak, S. (1985): On the complexity of the subgraph problem. Commentationes Mathematicae Universitatis Carolinae 26, Charles University Prague

    Google Scholar 

  • Richards, D., Liestman, A.L. (1985): Finding cycles of a given length. Annals of Discrete Mathematics, Vol. 27, pp. 249–256

    Google Scholar 

  • Robertson, N., Seymour, P.D. (1986): Graph minors. II. Algorithmic aspects of tree-width. Journal of Algorithms 7, 309–322

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Forschungsinstitut für Diskrete Mathematik, Universität Bonn, Nassestraße 2, D-5300, Bonn 1

    Jürgen Plehn & Bernd Voigt

Authors
  1. Jürgen Plehn
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bernd Voigt
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Rolf H. Möhring

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Plehn, J., Voigt, B. (1991). Finding minimally weighted subgraphs. In: Möhring, R.H. (eds) Graph-Theoretic Concepts in Computer Science. WG 1990. Lecture Notes in Computer Science, vol 484. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53832-1_28

Download citation

  • DOI: https://doi.org/10.1007/3-540-53832-1_28

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53832-5

  • Online ISBN: 978-3-540-46310-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation