Skip to main content
SpringerLink
Log in

Solving a combinatorial problem with network flows

  • Published:
Journal of Applied Mathematics and Computing Aims and scope Submit manuscript

Abstract

In this paper we present an algorithm based on network flow techniques which provides a solution for a combinatorial problem. Then, in order to provide all the solutions of this problem, we make use of an algorithm that given the bipartite graphG=(V 1 ∪V 2,E, w) outputs the enumeration of all bipartite matchings of given cardinalityv and costc.

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

Similar content being viewed by others

References

  1. R. Ahuja, T. Magnanti and J. Orlin,Network Flows, Prentice Hall, Inc., 1993.

  2. E. Ciurea,An algorithm for minimal dynamic flow, Korean J. Comput. & Appl. Math.7(2) (2000), 259–271.

    MATH  MathSciNet  Google Scholar 

  3. T. H. Cormen, C. E. Leiserson and R. R. Rivest,Introduction to Algorithms, MIT Press, 1990.

  4. L. P. Dinu,Aspecte Cantitative în Studiul Limbajelor, Ph. D. Thesis, Bucharest University, 2003.

  5. L. P. Dinu,On the classification and aggreation of hierarchies with different constitutive elements, Fundamenta Informaticae55(1) (2003), 39–50.

    MATH  MathSciNet  Google Scholar 

  6. K. Fukuda, T. Matsui,Finding all minimum cost perfect matchings in bipartite graphs, Networks22 (1992), 461–468.

    Article  MATH  MathSciNet  Google Scholar 

  7. K. Fukuda, T. Matsui,Finding all the perfect matchings in bipartite graphs, Appl. Math. Lett.7(1) (1994), 15–18.

    Article  MATH  MathSciNet  Google Scholar 

  8. H. W. Kuhn,The hungarian method for assignment problem, Naval Research Logistics Quarterly2 (1955), 83–97.

    Article  MathSciNet  Google Scholar 

  9. C. Ploscaru,Problema fluxului în reţele şi aplicaţii, Degree Thesis, Bucharest University, 2003.

  10. Yong Yeon Shin and Jai Shang Koh,An algorithm for generating minimal cutsets of undirected graphs, Korean J. Comput. & Appl. Math.5(3) (1998), 681–695.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Computer Science, Bucharest University, Academiei str., no. 14, 70109, Bucharest, Romania

    Florin Manea & Cąlina Ploscaru

Authors
  1. Florin Manea
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Cąlina Ploscaru
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Florin Manea.

Additional information

Florin Manea graduated from the Faculty of Mathematics and Computer Science, Bucharest University in the summer of 2003, with a degree in Computer Science. Now he is a Master student at the same faculty in the Department of Theoretical Computer Science. The main research interests of Florin Manea are Formal Languages, Complexity, Non-conventional Computational Paradigms, and Graphs Theory.

Cąlina Ploscaru graduated from the Faculty of Mathematics and Computer Science, Bucharest University in the summer of 2003, with a degree in Computer Science. Now she is a Master student at the Faculty of Letters, Bucharest University, where she is studying Computational Linguistics. Her main research interests are: Computational Linguistics, Graphs Theory, Artificial Intelligence and Databases Theory.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Manea, F., Ploscaru, C. Solving a combinatorial problem with network flows. JAMC 17, 391–399 (2005). https://doi.org/10.1007/BF02936064

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

AMS Mathematics Subject Classification

Key words and phrases

Search

Navigation