Skip to main content
SpringerLink
Log in

Combinatorial analysis (nonnegative matrices, algorithmic problems)

  • Published:
Journal of Soviet Mathematics Aims and scope Submit manuscript

Abstract

Properties of nonegative matrices and algorithmic problems of combinatorics are considered in this survey, which is a continuation of a paper by the same authors. The bibliography covers primarily works published in Ref. Zh. Matematika from 1980 to 1983.

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

Literature cited

  1. V. A. Arlazarov, A. V. Uskov, and I. A. Faradzhev, “An algorithm for finding all simple cycles in an oriented graph,” in: Investigations in Discrete Mathematics [in Russian], Nauka, Moscow (1973), pp. 178–183.

    Google Scholar 

  2. A. Ajo, J. Hopkroft, and J. Ulman, Construction and Analysis of Computing Algorithms [Russian translation], Mir, Moscow (1979).

    Google Scholar 

  3. N. N. Vorob'ev, Jr., “On the complexity of recognizing stability in graphs,” Multistep Differential, Coalition-Free and Cooperative Games and Their Applications [in Russian], Kalinin (1982), pp. 110–114.

  4. E. N. Gordeev, “New estimates in the covering problem,” Modeling and Optimization of Complex Control Systems [in Russian], Moscow (1981), pp. 116–122.

  5. M. Gary and D. Johnson, Computing Machines and Hard-to-Solve Problems [Russian translation], Mir, Moscow (1982).

    Google Scholar 

  6. G. P. Egorychev, “A polynomial identity for permanents,” Mat. Zametki,26, No. 6, 961–964 (1979).

    Google Scholar 

  7. G. P. Egorychev, “Solution of the van der Waerden problem for permanents,” Inst. Fiz. Sib. Otd. Akad. Nauk SSSR, Preprint, No. 13M (1980).

  8. G. P. Egorychev, “New formulas for permanents,” Dokl. Akad. Nauk SSSR,254, No. 4, 784–787 (1980).

    Google Scholar 

  9. G. P. Egorychev, “Proof of the van der Waerden conjecture for permanents,” Sib. Mat. Zh.,22, No. 6, 65–71 (1981).

    Google Scholar 

  10. A. V. Kozina, “On maximal matchings,” Vopr. Kibern. (Moskva), No. 26, 145–155 (1978).

    Google Scholar 

  11. G. N. Kopylov, “Finding a spanning tree of minimal diameter,” in: Heuristic Algorithms of Optimization [in Russian], Yaroslavl' (1981), pp. 50–57.

  12. N. M. Korneenko, “On the complexity of computing the distance between graphs,” Izv. Akad. Nauk BSSR, Ser. Fiz.-Mat. Nauk, No. 1, 101–103 (1982).

    Google Scholar 

  13. N. Kritofides, Graph Theory. An Algorithmic Approach [Russian translation], Mir, Moscow (1978).

    Google Scholar 

  14. N. N. Kuzyurin, “Asymptotic investigation of the covering problem,” Probl. Kibern. (Moskva), No. 37, 19–56 (1980).

    Google Scholar 

  15. N. N. Kuzyurin, “On minimal coverings of vertices of fixed weight in the unit n-dimensional cube,” Collection of Works of Mathematical Cybernetics [in Russian], Moscow (1981), pp. 143–152.

  16. N. N. Kuzyurin, “On the problem of α-depth of (0, 1)-matrices,” Vorp. Kibern. (Moskva), No. 87, 131–139 (1982).

    Google Scholar 

  17. H. Minc, Permanents [Russian translation], Mir, Moscow (1982).

    Google Scholar 

  18. R. G. Nigmatullin, “Recognition of the maximality of matching after 0(m+n) operations,” Rostock. Math. Kolloq., No. 13, 49–64 (1980).

    Google Scholar 

  19. R. G. Nigmatullin, “The problem of lower bounds of complexity and the theory of NP-completeness (a survey),” Izv. Vyssh. Uchebn. Zaved., Mat., No. 5, 17–25 (1981).

    Google Scholar 

  20. V. A. Nosov, V. N. Sachkov, and V. E. Tarakanov, “Combinatorial analysis. Matrix problems, the theory of selection,” Itogi Nauki i Tekh. VINITI. Teoriya Veroyatnostei. Mat. Stat. Teor. Kibern.,18, 53–93 (1981).

  21. G. S. Plesnevich and M. S. Saparov, Algorithms in Graph Theory [in Russian], Ashkhabad, Ylym (1981).

    Google Scholar 

  22. V. N. Reza, “On the van der Waerden conjecture regarding bistochastic matrices,” in: Current Computer and Programming Problems [in Russian], Dnepropetrovsk (1981), pp. 121–123.

  23. E. Rheingold, U. Nivergelt, and N. M. Deo, Combinatorial Algorithms. Theory and Practice [Russian translation], Mir, Moscow (1980).

    Google Scholar 

  24. V. N. Sachkov, “Combinatorial properties of nonnegative matrices,” Vopr. Kibern. (Moskva), No. 26, 37–50 (1978).

    Google Scholar 

  25. V. N. Sachkov, Introduction to Combinatorial Methods of Discrete Mathematics [in Russian], Nauka, Moscow (1982).

    Google Scholar 

  26. V. I. Solodovnikov, “Extension of Strassen's estimate to the solution of arbitrary systems of linear equations,” Zh. Vychisl. Mat. Mat. Fiz.,19, No. 3, 581–593 (1979).

    Google Scholar 

  27. Yu. N. Sotskov, “On the orientation of edges of a mixed graph,” Izv. Akad. Nauk BSSR, Ser. Fiz.-Mat. Nauk, No. 5, 22–24 (1981).

    Google Scholar 

  28. D. A. Suprunenko, “On equivalence of (0, 1)-matrices,” Izv. Akad. Nauk BSSR, Ser. Fiz.-Mat. Nauk, No. 5, 5–9 (1980).

    Google Scholar 

  29. V. E. Tarakanov, “On the problem of classification of (0, 1)-matrices,” Vopr. Kibern. (Moskva), No. 64, 67–80 (1980).

    Google Scholar 

  30. V. E. Tarakanov, “Combinatorial problems on binary matrices,” Combinatorn. Anal., Moscow, No. 5, 4–15 (1980).

    Google Scholar 

  31. V. E. Tarakanov, “On the depth of (0, 1)-matrices with identical row and identical column sums,” Mat. Zametki,34, No. 3, 463–476 (1983).

    Google Scholar 

  32. V. G. Ustyuzhaninov, “A typical length of a minimal covering for tables with spectrum,” Kibernetika, No. 5, 24–27 (1980).

    Google Scholar 

  33. D. I. Falikman, “Proof of the van der Waerden conjecture on the permanent of a doubly stochastic matrix,” Mat. Zametki,29, No. 6, 931–938 (1981).

    Google Scholar 

  34. V. Flyaisher and Ya. Khion, “Some problems of (0, 1)-matrices connected with the theory of bus schedules,” Zap. Tartus. Univ., No. 556, 75–84 (1981).

    Google Scholar 

  35. L. G. Khachiyan, “A polynomial algorithm in linear programming,” Dokl. Akad. Nauk SSSR,244, No. 5, 1093–1096 (1979).

    Google Scholar 

  36. V. S. Shevelev, “On the number of transversal families of two-element subsets of a finite set,” Vopr. Tekh. Diagnost., Rostov n/D, 1981, pp. 118–123.

  37. R. Aharoni, “A problem in rearrangements of (0, 1)-matrices,” Discrete Math.,30, No. 3, 191–201 (1980).

    Article  Google Scholar 

  38. R. Aharoni, “Representing matrices,” J. Combin. Theory,A29, No. 2, 151–165 (1980).

    Article  Google Scholar 

  39. R. Aharoni, “Extreme symmetric doubly stochastic matrices,” J. Combin. Theory,A29, No. 2, 263–265 (1980).

    Article  Google Scholar 

  40. M. Aigner, “Selecting the top three elements,” Discrete Appl. Math.,4, No. 4, 247–267 (1982).

    Article  Google Scholar 

  41. A. Alder and V. Strassen, “The algorithmic complexity of linear algebras,” Lect. Notes Comput. Sci.,122, 343–354 (1981).

    Google Scholar 

  42. R. P. Anstee, “Properties of (0, 1)-matrices with no triangles,” J. Combin. Theory,A29, No. 2, 186–198 (1980).

    Article  Google Scholar 

  43. R. P. Anstee, “Properties of (0, 1)-matrices with forbidden configurations,” Combinatorics '79, Part 2, Amsterdam e.a. (1980), pp. 177–179.

  44. R. P. Anstee, “Properties of (0, 1)-matrices without certain configurations,” J. Combin. Theory,A31, No. 3, 256–269 (1981).

    Article  Google Scholar 

  45. R. P. Anstee, “Triangular (0, 1)-matrices with prescribed row and column sums,” Discrete Math.,40, No. 1, 1–10 (1982).

    Article  Google Scholar 

  46. R. P. Anstee, “Properties of a class of (0, 1)-matrices covering a given matrix,” Can. J. Math.,34, No. 2, 438–453 (1982).

    Google Scholar 

  47. R. P. Anstee, “The network flows approach for matrices with given row and column sums,” Discrete Math.,44, No. 2, 125–138 (1983).

    Article  Google Scholar 

  48. R. Bapat and T. E. S. Raghavan, “On diagonal products of doubly stochastic matrices,” Linear Algebra Appl.,31, 71–75 (1980).

    Article  Google Scholar 

  49. R. Bar-Yehuda and U. Vishkin, “Complexity of finding k-path-free dominating sets in graphs,” Inf. Process. Lett.,14, No. 5, 228–232 (1983).

    Article  Google Scholar 

  50. M. Bautz, “Uber (0, 1)-Determinanten mit grossen Absolutwerten,” Wiss. Z. Techn. Hochsch. Ilmenau,27, No. 4, 39–55 (1981).

    Google Scholar 

  51. A. R. Bazelow, “Integer matrices with fixed row and column sums,” Ann. N. Y. Acad. Sci.,319, 593–594 (1979).

    Google Scholar 

  52. J. Beister, “A relationship between two lower bounds on the cardinality of a minimal cover,” Digit. Processes,6, No. 4, 217–225 (1980).

    Google Scholar 

  53. C. Berge, “Packing problems and hypergraph theory: a survey,” Discrete Optimization, Vol. 1, Amsterdam e. a. (1979), pp. 3–37.

    Google Scholar 

  54. C. Berge, “Balanced matrices and property (G),” Math. Program. Study,12, 163–175 (1980).

    Google Scholar 

  55. P. Bertolazzi, M. Lucertini, and S. Marchetti, “Analysis of a class of graph partitioning problems,” RAIRO. Inf. Theor.,16, No. 3, 255–261 (1982).

    Google Scholar 

  56. A. A. Bertossi, “The edge Hamiltonian path problem is NP-complete,” Inf. Process. Lett.,13, No. 4–5, 157–159 (1981).

    Article  Google Scholar 

  57. J. H. Bevis, F. J. Hall, and I. J. Katz, “Integer generalized inverse of incidence matrices,” Linear Algebra Appl.,39, 247–258 (1981).

    Article  Google Scholar 

  58. E. J. Billington, “On lambda coverings of pairs by triples repeated elements allowed in triples,” Util. Math.,C21, May, 187–203 (1982).

    Google Scholar 

  59. M. Blum, R. M. Karp, C. Vornberger, C. H. Papdimitriou, and M. Yannakakis, “The complexity of testing whether a graph is a superconcentrator,” Inf. Process. Lett.,13, No. 4–5, 164–167 (1981).

    Article  Google Scholar 

  60. B. Bollobas and E. J. Cockayne, “Graph-theoretic parameters concerning domination, independence, and irredundance,” J. Graph Theory,3, No. 3, 241–249 (1979).

    Google Scholar 

  61. B. Bollobas and C. Thomassen, “The size of connected hypergraphs with prescribed covering number,” J. Combin. Theory,B31, No. 2, 150–155 (1981).

    Google Scholar 

  62. K. S. Booth and J. H. Johnson, “Dominating sets in chordal graphs,” SIAM J. Comput.,11, No. 1, 191–199 (1982).

    Article  Google Scholar 

  63. K. S. Booth and R. J. Lipton, “Computing extremal and approximate distances in graphs having unit cost edges,” Acta Inf.,15, No. 4, 319–328 (1981).

    Google Scholar 

  64. A. Borodin, L. J. Guibas, N. A. Lynch, and A. C. Yao, “Efficient searching using partial ordering,” Inf. Process. Lett.,12, No. 2, 71–72 (1981).

    Article  Google Scholar 

  65. J. V. Brawley and M. Hankins, “On distribution by rank of bases for vector spaces of matrices over a finite field,” Linear Algebra Appl.,39, 91–101 (1981).

    Article  Google Scholar 

  66. J. L. Brenner and E. T. H. Wang, “Permanental pairs of double stochastic matrices. II,” Linear Algebra Appl.,28, 39–41 (1979).

    Article  Google Scholar 

  67. W. G. Bridges and R. A. Mena, “Rational circulants with rational spectra and cyclic strongly regular graphs,” Ars Combinatoria,8, 143–161 (1979).

    Google Scholar 

  68. R. A. Brualdi, “Matrices of 0's and 1's with total support,” J. Combin. Theory,A28, No. 3, 249–256 (1980).

    Article  Google Scholar 

  69. R. A. Brualdi, “Matrices of zeros and ones with fixed row and column sum vectors,” Linear Algebra Appl.,33, 159–231 (1980).

    Article  Google Scholar 

  70. R. A. Brualdi, “On the diagonal hypergraph of a matrix,” Combinatorics '79. Part 1, Amsterdam e. a. (1980), pp. 261–264.

  71. R. A. Brualdi, “On Haber's minimum term rank formula,” Eur. J. Comb.,2, No. 1, 17–20 (1981).

    Google Scholar 

  72. R. A. Brualdi, F. Harary, and Z. Miller, “Bigraphs versus digraphs via matrices,” J. Graph Theory,4, No. 1, 51–73 (1980).

    Google Scholar 

  73. R. A. Brualdi and Li Qiao, “Small diameter interchange graphs of classes of matrices of zeros and ones,” Linear Algebra Appl.,46, 177–194 (1982).

    Article  Google Scholar 

  74. R. A. Brualdi and J. A. Ross, “On Ryser's maximum term rank formula,” Linear Algebra Appl.,29, 33–38 (1980).

    Article  Google Scholar 

  75. R. A. Brualdi and J. A. Ross, “Matrices with isomorphic diagonal hypergraphs,” Discrete Math.,33, No. 2, 123–138 (1981).

    Article  Google Scholar 

  76. R. A. Brualdi and J. A. Ross, “Invariant sets for classes of matrices of zeros and ones,” Proc. Am. Math. Soc.,80, No. 4, 706–710 (1980).

    Google Scholar 

  77. Chao Chong-Yun, “On some sets of permutation matrices,” Linear Algebra Appl., No. 45, 131–134 (1982).

    Google Scholar 

  78. R. Chaudhuri and A. Mukherjea, “Idempotent Boolean matrices,” Semigroup Forum,21, No. 2–3, 273–282 (1980).

    Google Scholar 

  79. N. Chiba, T. Nishizeki, and N. Saito, “A linear algorithm for five-coloring a planar graph,” Lect. Notes Comput. Sci.,108, 9–19 (1981).

    Google Scholar 

  80. Toru Chiba, Ikuo Nishioka, and Isao Shirakawa, “An algorithm of maximal planarization of graphs,” Int. Symp. Circuits and Syst. Proc., Tokyo, 1979, New York, N. Y., s. a., pp. 649–652.

  81. M. H. Clapp and R. C. Shiflett, “A Birkhoff theorem for doubly stochastic matrices with vector entries,” Stud. Appl. Math.,62, No. 3, 273–279 (1980).

    Google Scholar 

  82. C. J. Colbourn and M. J. Colbourn, “Deciding Hadamard equivalence of Hadamard matrices,” BIT (Sver.),21, No. 3, 374–376 (1981).

    Article  Google Scholar 

  83. R. Cole and J. Hopcroft, “On edge coloring bipartite graphs,” SIAM J. Comput.,11, No. 3, 540–546 (1982).

    Article  Google Scholar 

  84. D. Coppersmith and S. Winograd, “On the asymptotic complexity of matrix multiplication,” SIAM J. Comput.,11, No. 3, 472–492 (1982).

    Article  Google Scholar 

  85. W. H. Cunningham and A. B. Marsh, III, “A primal algorithm for optimum matching,” Math. Program. Study,8, 50–72 (1978).

    Google Scholar 

  86. R. Dacic, “Common transversals of finite families,” Publ. Inst. Math.,26, 97–99 (1979).

    Google Scholar 

  87. D. De Caen and D. A. Gregory, “Prime Boolean matrices,” Lect. Notes Math.,829, 76–82 (1980).

    Google Scholar 

  88. M. Dehon, “Ranks of incidence matrices of (2, 3)-coverings,” Ars Combinatoria,9, 131–147 (1980).

    Google Scholar 

  89. J. Diaz, “Theδ-operator,” Math. Res.,2, 105–111 (1979).

    Google Scholar 

  90. B. Domanski, “The complexity of two decision problems for free groups,” Houston J. Math.,8, No. 1, 29–38 (1982).

    Google Scholar 

  91. F. Droebeke and M. Lorea, “Determination de valeurs du nombre de Turan T (n, 4, 6),” Cah. Cent. Etud. Rech. Oper.,24, No. 2–4, 185–191 (1982).

    Google Scholar 

  92. G. P. Egorychev, “The solution of van der Waerden's problem for permanents,” Adv. Math.,42, No. 3, 299–305 (1981).

    Article  Google Scholar 

  93. W. S. Ericksen, “Inverse pairs of matrices with integer elements,” SIAM J. Numer. Anal.,17, No. 3, 299–305 (1981).

    Google Scholar 

  94. A. Farley, S. Hedetniemi, and A. Proskurowski, “Partitioning trees: matching, domination, and maximum diameter,” Int. J. Comput. Inf. Sci.,10, No. 1, 55–61 (1981).

    Article  Google Scholar 

  95. W. Fernandez de la Vega and G. S. Lueker, “Bin packing can be solved within 1 + ε in linear time,” Combinatorica,1, No. 4, 349–355 (1981).

    Google Scholar 

  96. T. H. Foregger, “On the minimum value of the permanent of a nearly decomposable doubly stochastic matrix,” Linear Algebra Appl.,32, Aug., 78–85 (1980).

    Article  Google Scholar 

  97. R. J. Fowler, M. S. Paterson, and S. L. Tanimoto, “Optimal packing and covering in the plane are NP-complete,” Inf. Process. Lett.,12, No. 3, 133–137 (1981).

    Article  Google Scholar 

  98. W. D. Frazer, “On testing a binary operation for associativity,” Combinator. Algorithms, New York, N. Y. (1973), pp. 77–90.

  99. G. N. Frederickson and J. Ja'Ja', “Approximation algorithms for several graph augmentation problems,” SIAM J. Comput.,10, No. 2, 270–283 (1981).

    Article  Google Scholar 

  100. A. M. Frieze, “An algorithm for algebraic assignment problems,” Discrete Appl. Math.,1, No. 4, 253–259 (1979).

    Article  Google Scholar 

  101. H. N. Gabow, “Using Euler partitions to edge color bipartite multigraphs,” Int. J. Comput. Inform. Sci.,5, No. 4, 245–255 (1976).

    Google Scholar 

  102. H. W. Gabow and G. Kariv, “Algorithms for edge coloring bipartite graphs,” Conf. Rec. 10 Annu. ACM symp. Theory Comput., San Diego, Calif., 1978, New York, N. Y. (1978), pp. 184–192.

  103. A. M. Frieze and G. Kariv, “Algorithms for edge coloring bipartite graphs and multigraphs,” SIAM J. Comput.,11, No. 1, 117–129 (1982).

    Article  Google Scholar 

  104. H. W. Gabow and E. W. Myers, “Finding all spanning trees of direct and undirected graphs,” ISAM J. Comput.,7, No. 3, 280–287 (1978).

    Article  Google Scholar 

  105. M. R. Garey, R. L. Graham, D. S. Johnson, and D. E. Knuth, “Complexity results for bandwidth minimization,” SIAM J. Appl. Math.,34, No. 3, 477–495 (1978).

    Article  Google Scholar 

  106. P. M. Gibson, “Generalized doubly stochastic and permutation matrices over a ring,” Linear Algebra Appl.,30, 101–107 (1980).

    Article  Google Scholar 

  107. P. M. Gibson, “Permanental polytopes of doubly stochastic matrices,” Linear Algebra Appl.,32, Aug., 87–111 (1980).

    Article  Google Scholar 

  108. V. Gligor and D. Maier, “Finding augmented-set bases,” SIAM J. Comput.,11, No. 3, 602–609 (1982).

    Article  Google Scholar 

  109. T. Gonzales and J. Ja'Ja', “On the complexity of computing bilinear forms with {0, 1} constants,” J. Comput. Syst. Sci.,20, No. 1, 77–95 (1980).

    Article  Google Scholar 

  110. A. Goralcikova and V. Koubek, “A reduct-and-closure algorithm for graphs,” Lect. Notes Comput. Sci.,74, 301–307 (1979).

    Google Scholar 

  111. D. Gouyou-Beauchamps, “The Hamiltonian circuit problem is polynomial for 4-connected planar graphs,” SIAM J. Comput.,11, No. 3, 529–539 (1982).

    Article  Google Scholar 

  112. L. J. Gray and D. G. Wilson, “Nonnegative factorization of positive semidefinite nonnegative matrices,” Linear Algebra Appl.,31, 119–127 (1980).

    Article  Google Scholar 

  113. R. D. Grone, D. G. Hoffman, and J. R. Wall, “Permutation matrix groups with positive sum,” Linear Algebra Appl., No. 45, 29–34 (1982).

    Article  Google Scholar 

  114. B. Gyires, “The common source of several inequalities concerning doubly stochastic matrices,” Publ. Math.,27, No. 3–4, 291–304 (1980).

    Google Scholar 

  115. F. J. Hall and I. J. Katz, “More on integral generalized inverses of integral matrices,” Linear Multilinear Algebra,9, No. 3, 201–209 (1980).

    Google Scholar 

  116. P. Hansen, “Upper bounds for the stability number of a graph,” Rev. Roum. Math. Pures Appl.,24, No. 8, 1195–1199 (1979).

    Google Scholar 

  117. R. Hanson, “Integer matrices whose inverses contain only integers,” Two-Year Coll. Math. J.,13, No. 1, 18–21 (1982).

    Google Scholar 

  118. H. Harborth and I. Mengersen, “Ein Extremalproblem fur Matrizen aus Nullen und Einsen,” J. Reine Angew. Math.,309, 149–155 (1979).

    Google Scholar 

  119. R. Hassin, “Maximum flow in (s, t) planar networks,” Inf. Process. Lett.,13, No. 3, 737 (1981).

    Google Scholar 

  120. P. Hell and D. G. Kirkpatrick, “Scheduling, matching, and coloring,” Alg. Methods Graph Theory, Vol. 1, Amsterdam; Budapest (1981), pp. 273–279.

    Google Scholar 

  121. Hirata Tomio, Akira Marouka, and Kimura Masayuki, “Efficient algorithm to solve the path cover problem for reducible flow graphs,” Int. Symp. Circuits Syst. Proc., Tokyo, 1979, New York, N. Y., s. a., pp. 637–640.

  122. I. Holyer, “The NP-completeness of edge-coloring,” SIAM J. Comput.,10, No. 4, 718–720, (1981).

    Article  Google Scholar 

  123. I. Hoyler, “The NP-completeness of some edge-partition problems,” SIAM J. Comput.,10, No. 4, 713–717 (1981).

    Article  Google Scholar 

  124. Hsu Wen-Lian and G. L. Nemhauser, “Easy and hard bottleneck location problems,” Discrete Appl. Math.,1, No. 3, 209–215 (1979).

    Article  Google Scholar 

  125. Hsu Wen-Lian and G. L. Nemhauser, “Algorithms for minimum covering by cliques and maximum clique in claw-free perfect graphs,” Discrete Math.,37, No. 2–3, 181–191 (1981).

    Article  Google Scholar 

  126. A. Hubler, R. Klette, and G. Werner, “Shortest path algorithms for graphs of restricted in-degree and out-degree,” Elektron. Inf. Kybern.,18, No. 3, 141–151 (1982).

    Google Scholar 

  127. A. Itai, Y. Perl, and Y. Shiloach, “The complexity of finding maximum disjoint paths with length constraints,” Networks,12, No. 3, 277–286 (1982).

    Google Scholar 

  128. A. Itai and M. Rodeh, “Finding a minimum circuit in a graph,” Conf. Rec. 9th Annu. ACM Symp. Theory Comput., Boulder, Colo. (1977), New York, N. Y. (1977), pp. 1–10.

  129. A. Itai, M. Rodeh, and S. L. Tanimoto, “Some matching problems for bipartite graphs,” J. Assoc. Comput. Mach.,25, No. 4, 517–525 (1978).

    Google Scholar 

  130. J. Ja'Ja' and J. Simon, “Space efficient algorithms for some graph theoretical problems,” Acta Inf.,17, No. 4, 411–423 (1982).

    Google Scholar 

  131. S. K. Jain, “Nonnegative matrices having nonnegative generalized inverses,” Math. Stud.,46, No. 1, 42–48 (1978).

    Google Scholar 

  132. S. K. Jain, E. K. Kwak, and V. K. Goel, “Decomposition of nonnegative group-monotone matrices,” Trans. Am. Math. Soc.,257, No. 2, 371–385 (1980).

    Google Scholar 

  133. M. W. Jeter, “The infimum of a superadditive n-homogeneous function,” J. Indian Math. Soc.,42, No. 1–4, 345–352 (1978).

    Google Scholar 

  134. M. W. Jeter and W. C. Pye, “Some nonnegative matrices without nonnegative rank factorizations,” Ind. Math.,32, No. 1, 37–41 (1982).

    Google Scholar 

  135. E. C. Johnsen, “Real essentially stochastic matrices: factorizations into special elementary matrices,” Linear Multilinear Algebra,10, No. 4, 319–328 (1981).

    Google Scholar 

  136. C. R. Johnson, “Row stochastic matrices similar to doubly stochastic matrices,” Linear Multilinear Algebra,10, No. 2, 113–120 (1981).

    Google Scholar 

  137. R. Kallman, “A method for finding permanents of 0, 1 matrices,” Math. Comput.,38, No. 157, 167–170 (1982).

    Google Scholar 

  138. O. Kariv and S. L. Hakimi, “An algorithmic approach to network location problems. I. The p-centers,” SIAM J. Appl. Math.,37, No. 3, 513–538 (1979).

    Article  Google Scholar 

  139. O. Kariv and S. L. Hakimi, “An algorithmic approach to network location problems. II. The p-medians,” SIAM J. Appl. Math.,37, No. 3, 539–560 (1979).

    Article  Google Scholar 

  140. N. Katoh, T. Ibaraki, and H. Mine, “An algorithm for finding K minimum spanning trees,” SIAM J. Comput.,10, No. 2, 247–255 (1981).

    Article  Google Scholar 

  141. K. H. Kim, “An extension of the Dulmage-Mendelsohn theorem,” Linear Algebra Appl.,27, 187–197 (1979).

    Article  Google Scholar 

  142. K. H. Kim and F. W. Roush, “Some results on decidability of shift equivalence,” J. Combinatorics, Inf. Syst. Sci.,4, No. 2, 123–146 (1979).

    Google Scholar 

  143. K. H. Kim and F. W. Roush, “Generating all linear transformations,” Linear Algebra Appl.,37, 97–101 (1981).

    Article  Google Scholar 

  144. K. N. King and B. Smith-Thomas, “An optimal algorithm for sink-finding,” Inf. Process. Lett.,14, No. 3, 109–111 (1982).

    Article  Google Scholar 

  145. D. E. Knuth, “A permanent inequality,” Am. Math. Mon.,88, No. 10, 731–740 (1981).

    Google Scholar 

  146. J. Komar and J. Los, “Konig theorem in the infinite case (extended abstract),” Oper. Res-Verfahren,32, 153–155 (1978).

    Google Scholar 

  147. M. S. Krishnamoorthy and Deo Narsingh, “Node deletion NP-complete problems,” SIAM J. Comput.,8, No. 4, 619–625 (1979).

    Article  Google Scholar 

  148. H. J. Landau and A. M. Odlyzko, “Bounds for eigenvalues of certain stochastic matrices,” Linear Algebra Appl.,38, 5–15 (1981).

    Article  Google Scholar 

  149. E. L. Lawler, “Comment on computing the k shortest paths in a graph,” Commun. ASM,20, No. 8, 603–604 (1977).

    Article  Google Scholar 

  150. F. T. Leighton and M. Newman, “Positive-definite matrices and Catalan numbers,” Proc. Am. Math. Soc.,79, No. 2, 177–181 (1980).

    Google Scholar 

  151. M. Lewin and M. Neumann, “On the inverse M-matrix problem for (0, 1)-matrices,” Linear Algebra Appl.,30, 41–50 (1980).

    Article  Google Scholar 

  152. M. Lewin and J. Vitek, “A system of gaps in the exponent set of primitive matrices,” Ill. J. Math.,25, No. 1, 87–98 (1981).

    Google Scholar 

  153. J. Lewis and M. Yannakakis, “The node-deletion problem for hereditary properties is NP-complete,” J. Comput. Syst. Sci.,20, No. 2, 219–230 (1980).

    Article  Google Scholar 

  154. D. Lichtenstein, “Planar formulas and their uses,” SIAM J. Comput.,11, No. 2, 329–343 (1982).

    Article  Google Scholar 

  155. J. H. van Lint, “Notes on Egoritsjev's proof of the van der Waerden conjecture,” Linear Algebra Appl.,39, 1–8 (1981).

    Article  Google Scholar 

  156. J. H. van Lint, “The van der Waerden conjecture: two proofs in one year,” Math. Intell.,4, No. 2, 72–77 (1982).

    Google Scholar 

  157. W. Lipski, Jr. and F. P. Preparata, “Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems,” Acta Inf.,15, No. 4, 329–346 (1981).

    Google Scholar 

  158. D. London, “On the van der Waerden conjecture for matrices of rank two,” Linear Multilinear Algebra,8, No. 4, 281–289 (1980).

    Google Scholar 

  159. D. London, “On the Dokovic conjecture for matrices of rank two,” Linear Multilinear Algebra,9, No. 4, 317–327 (1981).

    Google Scholar 

  160. D. London, “Monotonicity of permanents of certain doubly stochastic circulant matrices,” Linear Algebra Appl.,37, 235–249 (1981).

    Article  Google Scholar 

  161. D. London, “Monotonicity of permanents of certain doubly stochastic matrices,” Pac. J. Math.,95, No. 1, 125–138 (1981).

    Google Scholar 

  162. A. Lubiw, “Some NP-complete problems similar to graph isomorphism,” SIAM J. Comput.,10, No. 1, 11–21 (1981).

    Article  Google Scholar 

  163. S. R. Mahaney, “On the number of P-isomorphism classes of NP-complete sets,” 22nd Annu. Symp. Found. Comput. Sci., Nashville, Tenn., Oct. 28–30, 1981, New York, N. Y. (1981), pp. 271–278.

  164. M. Malek-Shahmirzadi, “On a conjecture of D. Z. Dokovic,” Linear Algebra Appl.,30, 177–182 (1980).

    Article  Google Scholar 

  165. K. L. Manders and L. Adleman, “NP-complete decision problems for binary quadratics,” J. Comput. Syst. Sci.,16, No. 2, 168–184 (1978).

    Article  Google Scholar 

  166. A. Mansfield, “The relationship between the computational complexities of the legitimate deck and isomorphism problems,” Q. J. Math.,33, No. 131, 345–347 (1982).

    Google Scholar 

  167. J. N. McDonald, “On some zero configurations associated with the van der Waerden conjecture,” Linear Algebra Appl.,32, Aug., 137–155 (1980).

    Article  Google Scholar 

  168. R. A. Mena, “The characteristic polynomials of the plane of order 2,” J. Combinatorics, Inf. Syst. Sci.,7, No. 1, 91–93 (1982).

    Google Scholar 

  169. D. Merriell, “The maximum permanent in Λn k,” Linear Multilinear Algebra,9, No. 2, 81–91 (1980)

    Google Scholar 

  170. B. Mikolajczak, “On some problems associated with a memory minimization in finite automata,” Math. Models Comput. Syst. Proc. 3rd Hung. Comput. Sci. Conf., Budapest, Jan., 1981, Budapest (1981), pp. 55–61.

  171. P. Miliotis, G. Laporte, and Y. Nobert, “Computational comparison of two methods for finding the shortest complete cycle or circuit in a graph,” RAIRO. Rech. Oper.,15, No. 3, 233–239 (1981).

    Google Scholar 

  172. G. L. Miller, “On the nlogn isomorphism technique,” Conf. Rec. 10th Annu. ACM Symp. Theory Comput., San Diego, Calif. (1978), New York, N. Y. (1978), pp. 51–58.

  173. H. Minc, “On a conjecture of R. F. Scott (1881),” Linear Algebra Appl.,28, 141–153 (1979).

    Article  Google Scholar 

  174. H. Minc, “An asymptotic solution of the multidimensional dimer problem,” Linear Multilinear Algebra,8, No. 3, 235–239 (1980).

    Google Scholar 

  175. Motoko Tatsuya, “A note on upper bounds for the selection problem,” Inf. Process. Lett.,15, No. 5, 214–219 (1982).

    Article  Google Scholar 

  176. M. Mors, “A new result on the problem of Zarankiewicz,” J. Combin. Theory,A31, No. 2, 126–130 (1981).

    Article  Google Scholar 

  177. G. L. Mullen, “Equivalence classes of matrices over finite fields,” Linear Algebra Appl.,27, 61–68 (1979).

    Article  Google Scholar 

  178. E. Nemeth, J. Seberry, and M. Shu, “On the distribution of the permanent of cyclic (0, 1)-matrices,” Util. Math.,16, 171–182 (1979).

    Google Scholar 

  179. M. Newman, “On a problem suggested by Olga Taussky-Todd,” Ill. J. Math.,24, No. 1, 36–78 (1980).

    Google Scholar 

  180. M. Newman, “Determinants of circulants of prime power order,” Linear Multilinear Algebra,9, No. 3, 187–191 (1980).

    Google Scholar 

  181. A. Nijenhuis and H. S. Wilf, Combinatorial Algorithms, Academic Press, New York (1975).

    Google Scholar 

  182. J. Novak, “On a conjecture of Turan,” Cas. Pestov. Mat.,106, No. 2, 127–137 (1981).

    Google Scholar 

  183. S. C. Ntafos and S. L. Hakimi, “On the complexity of some coding problems,” IEEE Trans. Inf. Theory,27, No. 6, 794–796 (1981).

    Article  Google Scholar 

  184. C. van Nuffelen, “On adjacency matrices for hypergraphs,” Combinatorics '79, Part 2, Amsterdam e. a. (1980), p. 181.

  185. A. M. Odlyzko, “On the ranks of some (0, 1)-matrices with constant row sums,” J. Austral. Math. Soc.,A31, No. 2, 193–201 (1981).

    Google Scholar 

  186. T. Ohtsuki, “The two disjoint path problem and wire routing design,” Lect. Notes Comput. Sci.,108, 207–216 (1981).

    Google Scholar 

  187. M. L. Overton and A. Proskurowski, “Canonical incidence matrices of graphs,” BIT (Sver.),19, No. 2, 271–273 (1979).

    Article  Google Scholar 

  188. V. Ya. Pan, “Field extension and trilinear aggregating, uniting, and canceling for the acceleration of matrix multiplication,” 20th Annu. Symp. Found. Comput. Sci., San Juan 1979, New York, N. Y. (1979), pp. 28–38.

  189. V. Ya. Pan, “Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication,” Comput. Math.,8, No. 1, 23–34 (1982).

    Article  MathSciNet  Google Scholar 

  190. C. H. Papadimitriou and M. Yannakakis, “The clique problem for planar graphs,” Inf. Process. Lett.,13, No. 4–5, 131–133 (1981).

    Article  Google Scholar 

  191. Y. Pert and S. Zaks, “On the complexity of edge labelings for trees,” Theor. Comput. Sci.,19, No. 1, 1–16 (1982).

    Article  Google Scholar 

  192. V. A. Phuong, “Behavior of the permanent of a special class of doubly stochastic matrices,” Linear Multilinear Algebra,9, No. 3, 227–229 (1980).

    Google Scholar 

  193. J. Piehler, “Einige Betrachtungen uber 0-1-Determinanten,” Wiss. Z. Techn. Hochsch. Leuna-Merseburg,23, No. 3–4, 445–451 (1981).

    Google Scholar 

  194. J. Plesnik, “The complexity of designing a network with minimum diameter,” Networks,11, No. 1, 77–85 (1981).

    Google Scholar 

  195. J. Plesnik, “Complexity of decomposing graphs into factors with given diameters or radii,” Math. Slov. (CSSR),32, No. 4, 379–388 (1982).

    Google Scholar 

  196. S. Poljak and D. Turzik, “A polynomial algorithm for constructing a large bipartite subgraph with an application to a satisfiability problem,” Can. J. Math.,34, No. 3, 519–524 (1982).

    Google Scholar 

  197. A. Proskurowski and M. M. Syslo, “Minimum dominating cycles in outer-planar graphs,” Int. J. Comput. Inf. Sci.,10, No. 2, 127–139 (1981).

    Article  Google Scholar 

  198. J. H. Reif, “Minimum s-t cut of a planar unidrected network inO(nlogn 2) time,” Lect. Notes Comput. Sci., No. 115, 56–67 (1981).

    Google Scholar 

  199. B. Rice, “The 0–1 integer programming problem in a finite ring with identity,” Comput. Math.,7, No. 6, 497–502 (1981).

    Article  Google Scholar 

  200. R. L. Rivest and J. Vuillemin, “On recognizing graph properties from adjacency matrices,” Theor. Comput. Sci.,3, No. 3, 371–384 (1976).

    Article  Google Scholar 

  201. F. Romani, “Some properties of disjoint sums of tensors related to matrix multiplication,” SIAM J. Comput.,11, No. 2, 263–267 (1982).

    Article  Google Scholar 

  202. D. J. Rose and R. E. Tarjan, “Algorithmic aspects of vertex elimination on directed graphs,” SIAM J. Appl. Math.,34, No. 1, 176–197 (1978).

    Article  Google Scholar 

  203. H. J. Ryser, “A theorem in combinatorial matrix theory,” Linear Algebra Appl.,29, 451–458 (1980).

    Article  Google Scholar 

  204. H. J. Ryser, “Matrices and set intersections,” Linear Algebra Appl.,37, 267–275 (1981).

    Article  Google Scholar 

  205. G. Riha, “Boolevske matice jako incidencni matice grafu binarnich relaci,” Sb. pr. Ped. fak. UJEP Brne R. mat.-techn. ved.,7, 33–49 (1977).

    Google Scholar 

  206. H. Sachar, “The Fpspan of the incidence matrix of a finite protective plane,” Geom. Dedic,8, No. 4, 407–415 (1979).

    Google Scholar 

  207. C. Savage and J. Ja'Ja', “Fast, efficient parallel algorithms for some graph problems,” SIAM J. Comput.,10, No. 4, 682–691 (1981).

    Article  Google Scholar 

  208. Th. J. Schaefer, “The complexity of satisfiability problems,” Conf. Rec. 10 Annu. ACM Symp. Theory Comput., San Diego, Calif., 1978, New York, N. Y. (1978), pp. 216–226.

  209. R. Schmieder, “Bemerkungen zu einem Isomorphie-Problem fur Graphen, die speziellen Matrizen zugeordnet sind,” Math. Nachr.,90, 213–224 (1979).

    Google Scholar 

  210. H. Schneider and B. D. Saunders, “Applications of the Gordan-Stiemke theorem in combinatorial matrix theory,” Combinatorics '79, Part 2, Amsterdam e. a. (1980), p. 247.

  211. A. Schrijver and W. G. Valiant, “On lower bounds for permanents,” Proc. Kon. Ned. Akad. Wetensch.,A83, No. 4, 425–427 (1980).

    Google Scholar 

  212. R. Schroeppel and A. Shamir, “AT = O(2n/2),S=O2n/4) algorithm for certain NP-complete problems,” SIAM J. Comput.,10, No. 3, 456–464 (1981).

    Article  Google Scholar 

  213. Y. Shiloach, U. Vishkin, and S. Zaks, “Golden ratios in a pairs covering problem,” Discrete Math.,41, No. 1, 57–65 (1982).

    Article  Google Scholar 

  214. R. Sinkhorn, “Concerning the question of monotonicity of the permanent on the doubly stochastic matrices,” Linear Multilinear Algebra,8, No. 4, 323–328 (1980).

    Google Scholar 

  215. R. Sinkhorn, “Concerning the magnitude of the entries in a doubly stochastic matrix,” Linear Multilinear Algebra,10, No. 2, 107–112 (1981).

    Google Scholar 

  216. R. Sinkhorn, “Power symmetric stochastic matrices,” Linear Algebra Appl.,40, 225–228 (1981).

    Article  Google Scholar 

  217. D. B. Skillicorn, “Directed packings of pairs into quadruples,” J. Austral. Math. Soc.,A33, No. 2, 179–184 (1982).

    Google Scholar 

  218. D. B. Skillicorn, “Directed coverings,” J. Combinatorics, Inf. Syst. Sci.,7, No. 1, 48–53 (1982).

    Google Scholar 

  219. P. A. Smeds, “Line digraphs and the Moore-Penrose inverse,” Linear Algebra Appl.,36, 165–172 (1981).

    Article  Google Scholar 

  220. B. Smetaniuk, “A new construction on Latin squares — 1: a proof of the Evans conjecture,” Ars. Comb., June, 155–172 (1981).

    Google Scholar 

  221. R. G. Stanton and J. A. Bate, “A computer search for B-coverings,” Lect. Notes Math., No. 829, 37–50 (1980).

    Google Scholar 

  222. R. G. Stanton, P. D. Eades, G. H. J. van Rees, and D. D. Cowan, “Computation of some exact g-coverings,” Util. Math.,18, 269–282 (1980).

    Google Scholar 

  223. R. G. Stanton and R. C. Mullin, “Some new results on the covering numbers N(t, k, v),” Lect. Notes Math., No. 829, 51–58 (1980).

    Google Scholar 

  224. L. J. Stockmeyer and V. V. Vazirani, “NP-completeness of some generalizations of the maximum matching problem,” Inf. Process. Lett.,15, No. 1, 14–19 (1982).

    Article  Google Scholar 

  225. L. J. Stockmeyer and C. K. Wong, “On a number of comparisons to find the intersection of two relations,” SIAM J. Comput.,8, No. 3, 388–404 (1979).

    Article  Google Scholar 

  226. G. E. Suchan, “Concerning the minimum of permanents on doubly stochastic circulants,” Pac. J. Math.,95, No. 1, 213–217 (1981).

    Google Scholar 

  227. M. M. Systo, “An efficient cycle vector space algorithm for listing all cycles of a planar graph,” Alg. Methods in Graph Theory, Vol. 2, Amsterdam; Budapest (1981), pp. 749–762.

    Google Scholar 

  228. M. M. Systo, “An efficient cycle vector space algorithm for listing all cycles of a planar graph,” SIAM J. Comput.,10, No. 4, 797–808 (1981).

    Article  Google Scholar 

  229. R. E. Tarjan, “Finding edge-disjoint spanning trees,” Proc. 8th Haw. Int. Conf. Syst. Sci., Honolulu, Haw., S. 1. (1975), pp. 251–252.

  230. R. E. Tarjan and A. E. Trojanowski, “Finding a maximum independent set,” SIAM J. Comput.,6, No. 3, 537–546 (1977).

    Article  Google Scholar 

  231. J. Terno, “Complexity des Minimalgerus tes,” 24 Int. Wiss. Kolloq., Iimenau, 22 Okt.–26 Okt., 1979, Heft 5, Vortragsreihe B2, B3, Iimenau, s. a., pp. 23–25.

  232. D. T. Todorov and V. D. Tonchev, “On some coverings of triples,” Dokl. Bolg. Akad. Nauk,35, No. 9, 1209–1211 (1982).

    Google Scholar 

  233. W. T. Trotter, Jr. and T. R. Monroe, “A combinatorial problem involving graphs and matrices,” Discrete Math.,39, No. 1, 87–101 (1982).

    Article  Google Scholar 

  234. K. Truemper, “Complement total unimodularity,” Linear Algebra Appl.,30, 77–92 (1980).

    Article  Google Scholar 

  235. M. Truszczynski, “A simple algorithm of finding a cycle of length greater than three and without diagonals,” Computing,27, No. 1, 89–91 (1981).

    Google Scholar 

  236. Tsukiyama Shuji, Ariyoshi Hiromu, and Shirakawa Isao, “Algorithm to enumerate all the cutsets in O(¦V¦ + ¦E¦) time per cutset,” Int. Symp., Circuits and Syst. Proc., Tokyo, 1979, New York, N. Y., s. a., pp. 645–648.

  237. Tsukiyama Shuji, Sharakawa Isao, and Ozaki Hiroshi, “On the algorithm to enumerate all the cutsets in a graph,” Densi tsusin gakkai rombunsi, Trans. Inst. Electron. Commun. Eng. Jpn.,61, No. 7, 641–648 (1978).

    Google Scholar 

  238. Tsukiyama Shuji, Shirakawa Isao, Ozaki Hiroshi, and Ariyoshi Hiromu, “An algorithm to enumerate all cutsets of a graph in linear time per cutset,” J. Assoc. Comput. Mach.,27, No. 4, 619–632 (1980).

    Google Scholar 

  239. E. Verheiden, “Integral and rational completions of combinatorial matrices,” J. Combin. Theory,A27, No. 3, 267–276 (1978).

    Article  Google Scholar 

  240. E. Verheiden, “Integral and rational completions of combinatorial matrices. II,” J. Combin. Theory,A27, No. 2, 198–212 (1979).

    Article  Google Scholar 

  241. J. Vuillemin, “Comment verifier l'associativite d'une table de groupe,” Theor. Comput. Sci.,4, No. 1, 77–82 (1977).

    Article  Google Scholar 

  242. K. Wang, “On the matrix equation Am=γJ,” J. Combin. Theory,A29, No. 2, 134–141 (1980).

    Article  Google Scholar 

  243. Wei Wan-Di, “The classU(R ,S) of (0, 1)-matrices,” Discrete Math.,39, No. 3, 301–305 (1982).

    Article  Google Scholar 

  244. J. Wiedermann, “The complexity of lexicographic sorting and searching,” Lect. Notes Comput. Sci.,74, 517–522 (1979).

    Google Scholar 

  245. J. Wiedermann, “The complexity of lexicographic sorting and searching,” Appl. Mat.,26, No. 6, 432–436 (1981).

    Google Scholar 

  246. T. C. Wilson and J. Shortt, “An O(log n) algorithm for computing general order-k Fibonacci numbers,” Inf. Process. Lett.,10, No. 2, 68–75 (1980).

    Article  Google Scholar 

  247. M. Yannakakis, “Edge-deletion problems,” SIAM J. Comput.,10, No. 2, 297–309 (1981).

    Article  Google Scholar 

  248. A. C. Yao, D. M. Avis, and R. L. Rivest, “An Ω(n2 logn) lower bound to the shortest paths problem,” Conf. Rec. 9th Annu. ACM Symp. Theory Comput., Boulder, Colo., 1977, New York, N. Y. (1977), pp. 11–17.

Download references

Authors
  1. V. A. Nosov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. N. Sachkov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. V. E. Tarakanov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Itogi Nauki i Tekhniki, Seriya Teoriya Veroyatnostei, Mathematicheskaya Statistika, Teoreticheskaya Kibernetika, Vol. 21, pp. 120–178, 1983.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nosov, V.A., Sachkov, V.N. & Tarakanov, V.E. Combinatorial analysis (nonnegative matrices, algorithmic problems). J Math Sci 29, 1051–1099 (1985). https://doi.org/10.1007/BF02104831

Download citation

  • Issue Date:

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

Keywords

Search

Navigation