Skip to main content
SpringerLink
Log in

Integral packing of trees and branchings

  • Cybernetics
  • Published:
Cybernetics and Systems Analysis Aims and scope

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. V. A. Trubin, “The determination of the strength of a graph,” Dokl. Akad. Nauk SSSR,316, No. 5, 1060–1064 (1991).

    MATH  MathSciNet  Google Scholar 

  2. V. A. Trubin, “Homogeneity deficiency of a network and its reduction,” Tam. Zh.,318, No. 1, 43–47 (1991).

    MATH  Google Scholar 

  3. V. A. Trubin, “Strength of a network, reinforcement, and tree packing,” Kibernetika, No. 2, 67–75 (1991).

    MATH  MathSciNet  Google Scholar 

  4. V. A. Trubin, “Strength of a graph and packing of trees and branchings,” Kibernetika i Sistemnyi Analiz, No. 3, 94–99 (1993).

    MATH  MathSciNet  Google Scholar 

  5. V. A. Trubin, “Strength decomposition of graphs,” Dokl. Akad. Nauk,335, No. 1, 27–28 (1994).

    MATH  MathSciNet  Google Scholar 

  6. W. H. Cunningham, “Testing membership in matroid polyhedra,” J. Comb. Theory,36B, No. 2, 161–188 (1984).

    MathSciNet  Google Scholar 

  7. R. E. Bixby, O. M.-C. Marcotte, and L. E. Trotter, “Packing and covering with integral feasible flows in integral supply-demand networks,” Math. Program.,39, No. 3, 219–239 (1987).

    MathSciNet  Google Scholar 

  8. J. Edmonds, “Edge-disjoint branchings,” in: Combinatorial Algorithms, Algorithmics Press, New York (1972), pp. 91–96.

    Google Scholar 

  9. P. A. Pevzner, “Efficient algorithm to pack branchings in a weighted graph,” in: Combinatorial Methods in Flow Problems [in Russian], VNIISI, Moscow, No. 3, 113–123 (1979).

    Google Scholar 

  10. G. Gallo, M. D. Grigoriadis, and R. E. Tarjan, “A fast parametric maximum flow algorithm and applications,” SIAM J. Comput.,18, No. 1, 30–55 (1989).

    MathSciNet  Google Scholar 

Download references

Authors
  1. V. A. Trubin
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 1, pp. 29–33, January–February, 1995.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Trubin, V.A. Integral packing of trees and branchings. Cybern Syst Anal 31, 21–24 (1995). https://doi.org/10.1007/BF02366792

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02366792

Keywords

Search

Navigation