A REVIEW OF RECENT WORK IN JAPAN ON PRINCIPAL PARTITIONS OF MATROIDS AND THEIR APPLICATIONS 1

The principal partitions of graphs and matroids have many useful applications in engineering systems analysis and information theory. The partitions are based on the nonuniform distribution of the ranks of the minors of a matroid. This paper outlines the research carried out in Japan during the last decade with motivations from various fields of engineering science.

[1]  Satoru Fujishige,et al.  AN ALGORITHM FOR FINDING AN OPTIMAL INDEPENDENT LINKAGE , 1977 .

[2]  T. Ozawa.  On the minimal graphs of a certain class of graphs , 1971 .

[3]  Eugene L. Lawler,et al.  Matroid intersection algorithms , 1975, Math. Program..

[4]  Takao Ozawa,et al.  Topological conditions for the solvability of linear active networks , 1976 .

[5]  Stephen B. Maurer.  A maximum-rank minimum-term-rank theorem for matroids , 1975 .

[6]  Te Sun Han.  Nonnegative Entropy Measures of Multivariate Symmetric Correlations , 1978, Inf. Control..

[7]  S. Fujishige.  ALGORITHMS FOR SOLVING THE INDEPENDENT-FLOW PROBLEMS , 1978 .

[8]  Masao Iri,et al.  The Graphical Techniques Used for a Chemical Process Simulator "JUSE GIFS" , 1971, IFIP Congress.

[9]  Thomas M. Cover,et al.  A Proof of the Data Compression Theorem of Slepian and Wolf for Ergodic Sources , 1971 .

[10]  M. Iri.  The maximum-rank minimum-term-rank theorem for the pivotal transforms of a matrix , 1969 .

[11]  Louis Weinberg,et al.  The principal minors of a matroid , 1971 .

[12]  D. R. Fulkerson,et al.  Transversals and Matroid Partition , 1965 .

[13]  J. Edmonds.  Minimum partition of a matroid into independent subsets , 1965 .

[14]  W. Imrich,et al.  On the maximal distance of spanning trees , 1968 .

[15]  Jack K. Wolf,et al.  Noiseless coding of correlated information sources , 1973, IEEE Trans. Inf. Theory.

[16]  Edward C. van der Meulen,et al.  A survey of multi-way channels in information theory: 1961-1976 , 1977, IEEE Trans. Inf. Theory.

[17]  L. Weinberg,et al.  A constructive graph-theoretic solution of the Shannon switching game , 1970 .

[18]  Aaron D. Wyner,et al.  Recent results in the Shannon theory , 1974, IEEE Trans. Inf. Theory.

[19]  M. Iri,et al.  AN ALGORITHM FOR FINDING AN OPTIMAL "INDEPENDENT ASSIGNMENT" , 1976 .

[20]  Alfred Lehman,et al.  A Solution of the Shannon Switching Game , 1964 .

[21]  Michael Satosi Watanabe,et al.  Information Theoretical Analysis of Multivariate Correlation , 1960, IBM J. Res. Dev..

[22]  N. S. Mendelsohn,et al.  Coverings of Bipartite Graphs , 1958, Canadian Journal of Mathematics.

[23]  Jack Edmonds,et al.  Lehmans switching game and a theorem of Tutte and Nash-Williams , 1965 .

[24]  Nimrod Megiddo,et al.  Optimal flows in networks with multiple sources and sinks , 1974, Math. Program..

[25]  O. Ore.  Theory of Graphs , 1962 .