Skip to main content
SpringerLink
Log in

Engineering Applications of Matroids - A Survey

  • Chapter
Matroid Theory and its Applications

Part of the book series: C.I.M.E. Summer Schools ((CIME,volume 83))

Abstract

The aim of the present contribution is twofold. First, we sketch some engineering problems where matroids can be applied to obtain nontrivial results. Next, one application in electric network theory is described in some details. Effort was made to give a more or less complete list of references. The paper is intended for mathematicians — no previous knowledge in engineering is required.

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

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. Abdullah, A necessary condition for complete solvability of RLCT networks, IEEE Trans. Circ. Theory, CT-19 /1972/ 492–3.

    MathSciNet  Google Scholar 

  2. M. Aigner, T. A. Dowling, Matching theory for combinatorial geometries, Trans. Amer. Math. Soc. 158 /1971/ 231–245.

    MathSciNet  MATH  Google Scholar 

  3. L. Asimow, B. Roth, The rigidity of graphs, Trans. Amer. Math. Soc. 245 /1978/ 279–289.

    MathSciNet  MATH  Google Scholar 

  4. L. Asimow, B. Roth, The rigidity of graphs II, J. Math. Anal. … Appl. 68 /1979/ 171–190.

    MathSciNet  MATH  Google Scholar 

  5. V. Belevitch, Classical network theory, Holden-Day, San Francisco, 1968.

    MATH  Google Scholar 

  6. R. G. Bland, A combinatorial abstraction of linear programming, J. Combinatorial Theory Ser. 5. 23 /1977/ 33–57.

    MathSciNet  Google Scholar 

  7. E. Boiker, H. Crapo, How to brace a one-story building? Environment and Planning, B 4 /1977/ 125–152.

    Google Scholar 

  8. P. R. Bryant, The order of complexity of electrical networks, Proc. IEE (GB) 106 /1959/ 174–188.

    Google Scholar 

  9. H. J. Carlin, General n-port synthesis with negative resistors, Proc. IRE 48 /1960/ 1174–75.

    Google Scholar 

  10. H. J. Carlin, Singular network elements, IEEE Trans. Circ. Theory CT-11 /1964/ 67–72.

    Google Scholar 

  11. H. J. Carlin, D. C. Youla, Network synthesis with negative resistors, Proc. IRE 49 /1961/ 907–920.

    MathSciNet  Google Scholar 

  12. H. Crapo, Structural rigidity, Structural topology 1 /1979/ 26–45.

    MathSciNet  MATH  Google Scholar 

  13. H. Crapo, More on the bracing of one story buildings, Environment and Planning, B

    Google Scholar 

  14. R. J. Duffin, Topology of series-parallel networks, J. Math. Anal. … Appl. 10 /1965/ 303–318.

    MathSciNet  MATH  Google Scholar 

  15. J. Edmonds, Minimum partition of a matroid into independent sets, J. Res. Nat. Bureau Stand. 69B /1965/ 67–72.

    MathSciNet  Google Scholar 

  16. J. Edmonds, Systems of distinct representatives and linear algebra, J. Res. Nat. Bureau Stand. 71B /1967/ 241–245.

    MathSciNet  Google Scholar 

  17. J. Edmonds, Matroid partition, in: Math of the Decision Sciences, Part I. Lectures in Appl. Math. 11 /1968/ 335–345.

    MathSciNet  Google Scholar 

  18. J. Edmonds, Submodular functions, matroids and certain polyhedra, Combin. Structures and Their Appl. Gordon and Breach, New York etc. 1970. pp. 69–87.

    Google Scholar 

  19. J. Edmonds, Matroids and the greedy algorithm, Math. Programming 1 /1971/ 127–136.

    MathSciNet  MATH  Google Scholar 

  20. J. Edmonds, Matroid intersection, Annals of Discrete Math. 4 /1979/ 39–49.

    MathSciNet  MATH  Google Scholar 

  21. S. Fujishige, Polymatroidal dependence structure of a set of random variables, Information and Control, 39 /1978/ 55–72.

    MathSciNet  MATH  Google Scholar 

  22. T. -S. Han, The capacity region of general multi-access channel with certain correlated sources, Information and Control, 39.

    Google Scholar 

  23. T. -S. Han, Deterministic broadcast channels with a common message, Research Memorandum RMI 79–4, University of Tokyo, 1979.

    Google Scholar 

  24. T. -S. Han, Slepian-Wolf-Cover theorem for networks of channels

    Google Scholar 

  25. M. Iri, Network flow, transportation and scheduling: Theory and algorithms, Academic Press, New York etc. 1969.

    MATH  Google Scholar 

  26. M. Iri, A review of recent work in Japan in principal partitions of matroids and their applications, Annals New York Acad. Sci. 319 /1979/ 306–319.

    MathSciNet  Google Scholar 

  27. M. Iri, Survey of recent trends in applications of matroids, Proc. IEEE Intern. Symp. Circuits and Systems, Tokyo,1979,987.

    Google Scholar 

  28. M. Iri, A. Recski, Reflections on the concepts of dual, inverse and adjoint networks, Parts I–II, Technical Research Reports of the IECEJ, September 197 9 and January 1980 respectively.

    Google Scholar 

  29. M. Iri, A. Recski, What does duality really mean? Circuit Theory and Appl. 8 /1980/ 317–324.

    MathSciNet  MATH  Google Scholar 

  30. M. Iri, N. Tomizawa, A unifying approach to fundamental problems in network theory by means of matroids, Irans. IECEJ 58-A /1975/ 33–40.

    MathSciNet  Google Scholar 

  31. M. Iri, N. Tomizawa, S. Fujishige, On the controlability and observability of a linear system with combinatorial constraints Trans. Soc. Instrument … Control Engs. 13 /1977/ 225–242.

    Google Scholar 

  32. P. M. Jensen, Matroids and error-correcting codes, thesis, Danmarks Tekniske Hϕjskole, Lyngby, 1977.

    Google Scholar 

  33. G. Kirchhoff,Über die Auflösung der Gleichungen, auf welche man bei der Untersuchungen der linearen Verteilung galvanischer Ströme geflihrt wird, Poggendorff Ann. Phys. 72 /1847/ 497–508.

    Google Scholar 

  34. D. E. Knuth, Matroid partitioning, Report Stan-CS-73-342, stan-ford University, 1973.

    Google Scholar 

  35. S. Krogdahl, A combinatorial base for some optimal matroid intersection algorithms, Report Stan-CS-74-468, Stanford Univ.

    Google Scholar 

  36. G. Laman, On graphs and rigidity of plane skeletal structures, J. Engineering Math, 4 /1970/ 331–340.

    MathSciNet  MATH  Google Scholar 

  37. E. L. Lawler, Matroid intersection algorithms, Math. Programming 9 /1975/ 31–56.

    MathSciNet  MATH  Google Scholar 

  38. E. L. Lawler, Combinatorial optimization: Networks and matroids Holt, Rinehart and Winston New York, 1976.

    MATH  Google Scholar 

  39. L. Lovász, The matroid matching problem, Coll. Math. Soc. János Bolyai, Algebraic methods in graph theory, Szeged, 197S.

    Google Scholar 

  40. L. Lovász, Matroid matching and some applications, J. Combinatorial Theory Ser. B, 28. /1980/ 208–236.

    MATH  Google Scholar 

  41. L. Lovász, Selecting independent lines from a family of lines in a space, Acta Sci. Math. Szeged 42 /1980/ 121–131.

    MathSciNet  MATH  Google Scholar 

  42. L. Lovász, Y. Yemini, On generic rigidity in the plane

    Google Scholar 

  43. J. H. Mason, On a class of matroids arising from paths in graphs, Proc. London Math. Soc. (3) 25 /1972/ 55–74.

    MathSciNet  MATH  Google Scholar 

  44. J. C. Maxwell, Electricity and magnetism Clarendon Press, Oxford, 1892.

    Google Scholar 

  45. M. M. Milic, The state-variable characterization of a class of linear time-varying nonreciprocal networks, Proc. Intern. Symp. Network Theory, Belgrade, 1968. pp. 31–40.

    Google Scholar 

  46. M. M. Milić, Explicit formulation of the state equations for a class of degenerate linear networks, Proc. IEE (GB) 118 /1971/ 742–745.

    Google Scholar 

  47. M. M. Milić, Some topologico-dynamical properties of linear passive reciprocal networks, Circuit Theory … Appl. 5 /1977/ 417.

    MATH  Google Scholar 

  48. T. Nitta, A. Kishima, Solvability and state equations of RCG networks, Trans. IECEJ E-60 /1977/ 410.

    Google Scholar 

  49. T. Nitta, A. Kara, T. Okada, An algorithm of a proper tree in an RCG network, Trans. IECEJ E-62 /1979/ 492.

    Google Scholar 

  50. B. Petersen, Investigating solvability and complexity of linear active networks by means of matroids, IEEE Trans. Circuits … Systems, CAS-26 /1979/ 330–342.

    Google Scholar 

  51. A. Recski, Contributions to the n-port interconnection problem by means of matroids, Coll. Math. Soc. Jànos Bolyai,18. Combinatorics, Keszthely, 1976. North-Holland, Amsterdam, 877–892.

    Google Scholar 

  52. A. Recski, Unique solvability and order of complexity of linear networks containing memoryless n-ports, Circuit Theory … Appl. 7 /1919/ 31–42.

    Google Scholar 

  53. A. Recski, Sufficient conditions for the unique solvability of linear networks containing memoryless 2-ports, Circuit Theory … Appl. 8 /1980/ 95–103.

    MathSciNet  MATH  Google Scholar 

  54. A. Recski, Matroids and network synthesis, Proc. 1980 European Conf. on Circuit Theory … Design, Warsaw, 1980. 192–197.

    Google Scholar 

  55. A. Recski, M. Iri, Network theory and transversal matroids, Discrete Applied Math.

    Google Scholar 

  56. A. Recski, J. Takàcs, On the combinatorial sufficient conditions for linear network solvability, Circuit Theory … Appl.

    Google Scholar 

  57. R. A. Rohrer, Circuit theory: An introduction to the state variable approach, McGraw-Hill, New York, 1970.

    MATH  Google Scholar 

  58. I. G. Rosenberg, Structural rigidity I, Foundations and rigidity criteria, Université de Montréal, Preprint CRMA 908, 1979.

    Google Scholar 

  59. K. Sugihara, Non-metrical approach to determining the structure of concepts,Univ. of Tokyo, Preprint RMI 78-01, 1978.

    Google Scholar 

  60. K. Sugihara, A step toward man-machine communication by means of line drawings of polyhedra, Bull. Electrotechn. Lab. of Japan, 42 /1978/ 20–43.

    Google Scholar 

  61. K. Sugihara, Studies on mathematical structures of line drawings of polyhedra and their applications to scene analysis, Electrotechn. Lab. of Japan, Preprint No. 800, 1979.

    Google Scholar 

  62. K. Sugihara, M. Iri, A mathematical approach to the determination of the structure of concepts, The Matrix … Tensor Quart, 30 /1980/ 62–75.

    MathSciNet  Google Scholar 

  63. D. J. A. Welsh, Matroid theory, Academic Press, London etc. 1976.

    MATH  Google Scholar 

  64. D. J. A. Welsh, this volume.

    Google Scholar 

  65. W. Whiteley, Introduction to structural geometry I–II, preprint.

    Google Scholar 

  66. R. E. Bixby, A composition for matroids, J. Combinatorial Theory Ser. B. 18. /1975/ 59–72.

    MathSciNet  MATH  Google Scholar 

  67. J. Bruno, L. Weinberg, A constructive graph-theoretic solution of the Shannon switching game, IEEE Trans. Circuit Theory, CT-17 /1970/ 74–81.

    MathSciNet  Google Scholar 

  68. J. Bruno, L. Weinberg, Principal partition and principal minors of a matroid, with applications, Annals New York Acad. Sci. 175 /1970/ 49–65.

    MathSciNet  MATH  Google Scholar 

  69. J. Bruno, L. Weinberg, The principal minors of a matroid, Linear Algebra … Its Appl. 4 /1971/ 19–59.

    MathSciNet  Google Scholar 

  70. J. Bruno, L. Weinberg, Generalized networks: Networks, embedded on a matroid I–II, Networks, 6 /1976/ 53–94 and 231–272.

    MathSciNet  MATH  Google Scholar 

  71. T. Brylawski, A combinatorial model for series-parallel networks, Trans. Amer. Math. Soc. l5A /1971/ 1–22.

    MathSciNet  Google Scholar 

  72. J. Clausen, thesis, University of Copenhagen, 1978.

    Google Scholar 

  73. A. Csurgay, Z. Kovacs, A. Recski, On the transient analysis of lumped-distributed nonlinear networks, Proc. 5th Internat. Coll. Microwave Commun. Budapest, 1974.

    Google Scholar 

  74. R. J. Duffin, T. D. Morley, Wang algebra and matroids, IEEE Trans. Circuits … Systems, CAS-25 /1978/ 755–762.

    MathSciNet  Google Scholar 

  75. C. A. Holzmann, Realization of netoids, Proc. 20th Midwest Symp. Circuits and Systems, Lubbock, Texas, 1977. pp. 394–398.

    Google Scholar 

  76. C. A. Holzmann, Binary netoids, Proc. IEEE Intern. Symp. Circuits and Systems, Tokyo, 1979. pp. 1000–1003.

    Google Scholar 

  77. M. Iri, Combinatorial canonical form of a matrix with applications to the principal partition of a graph, Electronics … Communication in Japan, 54 /1971/ 30–37.

    MathSciNet  Google Scholar 

  78. M. Iri, The maximum-rank minimum-term-rank theorem for the pivotal transforms of a matrix, Linear Algebra … Its Appl. 2/1969/ 427–446.

    MathSciNet  MATH  Google Scholar 

  79. M. Iri, Practical algorithms for transformations of matroids, and their applications to the problems of networks and control, Proc. 12th Intern. Meeting of TIMS, Kyoto, 1975. SI7. 2

    Google Scholar 

  80. M. Iri, A practical algorithm for the Menger-type generalization of the independent assignement problem, Math. Programming Study, 8 /1978/ 88–105.

    MathSciNet  Google Scholar 

  81. M. Iri, S. Fujishige, Use of matroid theory in operations research, circuits and systems theory, Intern. J. Systems Science

    Google Scholar 

  82. M. Iri, N. Tomizawa, A practical criterion for the existence of the unique solution in a linear electrical network with mutual couplings, Trans. IECEJ. 57-A /1974/ 35–41.

    MathSciNet  Google Scholar 

  83. M. Iri, N. Tomizawa, An algorithm for finding an optimal “independent assignment”, J. Oper. Res. Soc. Jap. 19 /1976/ 32–57.

    MathSciNet  MATH  Google Scholar 

  84. G. Kishi, Y. Kajitani, On maximally distinct trees, Proc. 5th Annual Allerton Conf. Circuits and Systems, 1967. 635–643.

    Google Scholar 

  85. G. Kishi, Y. Kajitani, Maximally distinct trees in a linear graph, Trans. IECEJ. 51-A /1968/ 196–203.

    MathSciNet  Google Scholar 

  86. G. Kishi, Y. Kajitani, Topological considerations on minimal sets of variables describing an LCR network, IEEE Trans. Circuit Theory, CT-20 /1973/ 335–340.

    MathSciNet  Google Scholar 

  87. S. B. Maurer, A maximum-rank minimum-term-rank theorem for mat-roids, Linear Algebra … Its Appl. 10 /1975/ 129–137.

    MathSciNet  MATH  Google Scholar 

  88. G. Minty, On the axiomatic foundations for the theories of directed linear graphs, electrical networks and network programming, J. Math. … Mechanics, 15 /1966/ 485–520.

    MathSciNet  MATH  Google Scholar 

  89. M. Nakamura, thesis, University of Tokyo, 1979.

    Google Scholar 

  90. M. Nakamura, M. Iri, Fine structures of matroid intersections and their applications, Proc. IEEE Intern Symp. Circuits and Systems, Tokyo, 1979. pp. 996–999.

    Google Scholar 

  91. M. Nakamura, M. Iri, On the structure of directed spanning trees: An application of principal partition, Technical Research Rept. of the IECEJ, 1979.

    Google Scholar 

  92. M. Nakamura, M. Iri, A structural theory for matroid and polymat-roid intersection,

    Google Scholar 

  93. H. Narayanan, thesis, Indian Inst. Techn. Bombay, 1974.

    Google Scholar 

  94. H. Narayanan, A theorem on graphs and its application to network analysis, Proc. IEEE Intern. Symp. Circuits and Systems, Tokyo, 1979. pp. 1008–1011.

    Google Scholar 

  95. T. Nitta, thesis, Kyoto University, 1977.

    Google Scholar 

  96. T. Nitta, A. Kishima, State equation of linear networks with dependent sources, based on network topology, Trans. IECEJ. 60/1911/ 1046–1053.

    Google Scholar 

  97. T. Ohtsuki, Y. Ishizeki, H. Watanabe, Network analysis and topological degrees of freedom, Trans. IECEJ. 51 /1968/ 238–245.

    Google Scholar 

  98. T. Ohtsuki, T. Tsuchiya, Y. Ishizeki, H. Watanabe, Y. Kaj itani, G. Kishi, Topological degrees of freedom of electrical networks, Proc. 5th Annu. Allerton Conf. Circuits and Systems,1967. 643–653.

    Google Scholar 

  99. T. Ohtsuki, H. Watanabe, State variable analysis of RLC networks containing nonlinear coupling elements, Trans. IEEE Circuit Theory CT-16 /1969/ 26–38.

    MathSciNet  Google Scholar 

  100. T. Ozawa, On the minimal graphs of a certain class of graphs, IEEE Trans. Circuit Theory, CT-18 /1971/ 387.

    Google Scholar 

  101. T. Ozawa, A procedure of graph partitioning for the mixed analysis of electrical networks, Mem. Fac. Eng. Kyoto Univ. 33/1911/

    Google Scholar 

  102. T. Ozawa, Order of complexity of linear active networks and a common tree in the 2-graph method, Electr. Letters 8/1972/542.

    Google Scholar 

  103. T. Ozawa, On the degrees of interferences and certain trees of a multicoloured-branch graph, Trans. IECEJ. 55/1972/ 642–643.

    Google Scholar 

  104. T. Ozawa, On the existence of a common tree in the 2-graph method, Trans. IECEJ. 56 /1973/ 371–372.

    Google Scholar 

  105. T. Ozawa, Common trees and partition of two-graphs, Trans. IECEJ. 57 /1974/ 383–390.

    Google Scholar 

  106. T. Ozawa, Solvability of linear electric networks, Mem. Fac. Eng. Kyoto Univ. 37 /1975/ 299–315.

    Google Scholar 

  107. T. Ozawa, Topological conditions for the solvability of active linear networks, Circuit Th. … Appl. 4 /1976/ 125–136.

    MATH  Google Scholar 

  108. T. Ozawa, Structure of 2-graphs, Trans. IECEJ., 9-A /1976/ 262–263.

    Google Scholar 

  109. T. Ozawa, Y. Kajitani, Diagnosability of linear active networks, Proc. IEEE Intern. Symp. Circuits and Systems, Tokyo, 1979. 866–9.

    Google Scholar 

  110. T. Ozawa, T. Nitta, Some considerations on the state equations of linear active networks and network topology, Mem. Fao. Eng. Kyoto University,, 34 /1972/ 413–424.

    Google Scholar 

  111. Pasztor Z., thesis, University of Budapest, 1977.

    Google Scholar 

  112. Petersen, B., thesis, Danmarks Tekniske Hϕjskole, Lyngby, 1976.

    Google Scholar 

  113. B. Petersen, Investigating solvability and complexity of linear active networks, Proc. 1978. European Conf. Circuit Th. and Design, Lausanne, 1978. pp. 508–512.

    Google Scholar 

  114. B. Petersen, The qualitative appearance of linear active network transfer functions by means of matroids, Proc. IEEE Intern. Symp. Circuits and Systems, Tokyo, 1979. 992–995.

    Google Scholar 

  115. B. Petersen, Algorithms for topological investigation of linear active networks, Proc. IEEE Intern. Symp. Circuits and Systems, New York, 1980. 354–358.

    Google Scholar 

  116. B. Petersen, Circuits in the union of matroids: An algorithmic approach.

    Google Scholar 

  117. A. Recski, On partitional matroids with applications, Coll. Math. Soc. J. Bolyai 10. North-Holland, 1974. II. 1169–1179.

    MathSciNet  Google Scholar 

  118. A. Recski, Matroids and state variables, Proc. 1976 Europ. Conf. Circuit Theory and Design, Genova, 1976. I. 44–51.

    Google Scholar 

  119. A. Recski, On the sum of matroids II, Proc. 5th British Combinatorial Conf, Aberdeen, 1975. 515–520.

    Google Scholar 

  120. A. Recski, Applications of graph theory to network analysis— a survey, Beitrdge zur Graphentheorie und deren Anwendungen Proc. Conf. Oberhof /G. D. R./1977. pp. 193–200.

    Google Scholar 

  121. A. Recski, Matroidal structure of n-ports, Coll. Math. Soo. J. Bolyai 18. North-Holland, 1978. II. 893–909.

    MathSciNet  Google Scholar 

  122. A. Recski, Matroids in network theory, Proc. 6th Intern. Symp. on Microwave Communication, Budapest, 1978.

    Google Scholar 

  123. A. Recski, Sufficient conditions for the unique solvability of networks containing linear memoryless 2-ports, Proc. 1978. Europ. Conf. Circuit Theory and Design,Lausanne,1978. 93–97.

    Google Scholar 

  124. A. Recski, Terminal solvability and the n-port interconnection problem, Proc. IEEE Intern. Symp. Circuits and Systems, Tokyo, 1979. pp. 988–991.

    Google Scholar 

  125. M. Saito, T. Asano, T. Nishizeki, On the 3-terminal matroids, Techn. Research Report of the IECEJ, 1979.

    Google Scholar 

  126. M. Sengoku, T. Matsumoto, On maximal circuit-free and cutset-free subgraphs and hybrid trees in a linear graph, Proc. IEEE Intern Symp. Circuits and Systems, 1975. pp. 104–107.

    Google Scholar 

  127. S. Shinoda, H. Sakuma, T. Yasuda, Semimatroids, Proc. IEEE Intern. Symp. Circuits and Systems, 1979. Tokyo, pp. 1004–1007.

    Google Scholar 

  128. C. A. B. Smith, Electric currents in regular matroids, Proc. 4th British Combinatorial Conference, 1973.

    Google Scholar 

  129. C. A. B. Smith, Patrolds. J. Combinatorial Th. Ser. B. 16 /1974/64.

    MATH  Google Scholar 

  130. J. Takacs, thesis, University of Budapest, 1978.

    Google Scholar 

  131. N. Tomizawa, A practical criterion for the existence of a linkage pair of bases in a muoid and an algorithm for determining the maximally distant linkage pair of bases, Trans. IECEJ. 59-A /1976/ 280–286.

    MathSciNet  Google Scholar 

  132. N. Tomizawa, Strongly irreducible matroids and principal partition of a matroid into strongly irreducible minors, Trans. IECEJ. 59-E /1976/ 14–15.

    MathSciNet  Google Scholar 

  133. N. Tomizawa-M. Iri, An algorithm for solving the “independent assignment problem” with application to the problem of determining the order of complexity of a network, Trans. IECEJ. 57-A /1974/ 627–629.

    MathSciNet  Google Scholar 

  134. N. Tomizawa-M. Iri, An algorithm for determining the rank of a triple matrix product AXB with application to the problem of discerning the existence of the unique solution in a network, Trans, IECEJ. 57-A /1974/ 50–57.

    MathSciNet  Google Scholar 

  135. V. Torma, thesis, University of Budapest, 1977.

    Google Scholar 

  136. Z. Ünver, thesis, Middle East Technical Univ., Ankara, 1978.

    Google Scholar 

  137. Z. Ünver-Y. Ceyhun, On a graphical representation for matroids

    Google Scholar 

  138. L. Weinberg, Matroids, generalized networks and electric network synthesis, J. Combinatorial Theory Ser. B. 23 /1977/ 106–126.

    MathSciNet  MATH  Google Scholar 

  139. L. Weinberg, Duality in networks: Roses, bouquets and cut sets; Trees, forests and polygons, Networks, 5 /1975/ 179.

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research Institute for Telecommunication, Budapest, 1026, Hungary

    AndrÁs Recski

Authors
  1. AndrÁs Recski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

A. Barlotti

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Recski, A. (2010). Engineering Applications of Matroids - A Survey . In: Barlotti, A. (eds) Matroid Theory and its Applications. C.I.M.E. Summer Schools, vol 83. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11110-5_6

Download citation

Publish with us

Policies and ethics

Search

Navigation