Sengupta, Raja; Lafortune, Stéphane A graph-theoretic optimal control problem for terminating discrete event processes. (English) Zbl 0777.90072 Discrete Event Dyn. Syst. 2, No. 2, 139-172 (1992). MSC: 90C35 90C39 PDFBibTeX XMLCite \textit{R. Sengupta} and \textit{S. Lafortune}, Discrete Event Dyn. Syst. 2, No. 2, 139--172 (1992; Zbl 0777.90072) Full Text: DOI
Valuev, D. I. Minimizing the location length of a directed graph. (English. Russian original) Zbl 0875.68713 Cybern. Syst. Anal. 28, No. 1, 151-154 (1992); translation from Kibern. Sist. Anal. 1992, No. 1, 172-175 (1992). MSC: 68R10 05C20 PDFBibTeX XMLCite \textit{D. I. Valuev}, Cybern. Syst. Anal. 28, No. 1, 151--154 (1992; Zbl 0875.68713); translation from Kibern. Sist. Anal. 1992, No. 1, 172--175 (1992) Full Text: DOI
Blidia, Mostafa; Engel, Konrad Perfectly orderable graphs and almost all perfect graphs are kernel \(M\)- solvable. (English) Zbl 0761.05090 Graphs Comb. 8, No. 2, 103-108 (1992). Reviewer: C.N.Bouza (Vedado) MSC: 05C99 05C20 PDFBibTeX XMLCite \textit{M. Blidia} and \textit{K. Engel}, Graphs Comb. 8, No. 2, 103--108 (1992; Zbl 0761.05090) Full Text: DOI
Chu, Jeff Optimal algorithm for the nearest common dominator problem. (English) Zbl 0768.68128 J. Algorithms 13, No. 4, 693-697 (1992). MSC: 68R10 05C20 05C85 05C38 PDFBibTeX XMLCite \textit{J. Chu}, J. Algorithms 13, No. 4, 693--697 (1992; Zbl 0768.68128) Full Text: DOI
Fishburn, P. C.; Gehrlein, W. V. Niche numbers. (English) Zbl 0758.05092 J. Graph Theory 16, No. 2, 131-139 (1992). Reviewer: J.W.Moon (Edmonton) MSC: 05C99 05C20 PDFBibTeX XMLCite \textit{P. C. Fishburn} and \textit{W. V. Gehrlein}, J. Graph Theory 16, No. 2, 131--139 (1992; Zbl 0758.05092) Full Text: DOI
Kim, Suh-Ryung; Roberts, Fred S.; Seager, Suzanne On \(1\,0\,1\)-clear \((0,1)\) matrices and the double competition number of bipartite graphs. (English) Zbl 1230.05069 J. Comb. Inf. Syst. Sci. 17, No. 3-4, 302-315 (1992). MSC: 05B20 05C20 PDFBibTeX XMLCite \textit{S.-R. Kim} et al., J. Comb. Inf. Syst. Sci. 17, No. 3--4, 302--315 (1992; Zbl 1230.05069)
Di Battista, Giuseppe; Tamassia, Roberto; Tollis, Ioannis G. Area requirement and symmetry display of planar upward drawings. (English) Zbl 0757.05055 Discrete Comput. Geom. 7, No. 4, 381-401 (1992). Reviewer: J.W.Moon (Edmonton) MSC: 05C20 05C10 05C85 PDFBibTeX XMLCite \textit{G. Di Battista} et al., Discrete Comput. Geom. 7, No. 4, 381--401 (1992; Zbl 0757.05055) Full Text: DOI EuDML
Pothen, Alex; Alvarado, Fernando L. A fast reordering algorithm for parallel sparse triangular solution. (English) Zbl 0744.65024 SIAM J. Sci. Stat. Comput. 13, No. 2, 645-653 (1992). Reviewer: W.Schönauer (Karlsruhe) MSC: 65F05 65F50 65Y05 68R10 PDFBibTeX XMLCite \textit{A. Pothen} and \textit{F. L. Alvarado}, SIAM J. Sci. Stat. Comput. 13, No. 2, 645--653 (1992; Zbl 0744.65024) Full Text: DOI Link
Eisenstat, Stanley C.; Liu, Joseph W. H. Exploiting structural symmetry in unsymmetric sparse symbolic factorization. (English) Zbl 0746.65023 SIAM J. Matrix Anal. Appl. 13, No. 1, 202-211 (1992). Reviewer: T.C.Mohan (Madras) MSC: 65F05 65F50 68R10 PDFBibTeX XMLCite \textit{S. C. Eisenstat} and \textit{J. W. H. Liu}, SIAM J. Matrix Anal. Appl. 13, No. 1, 202--211 (1992; Zbl 0746.65023) Full Text: DOI
Wang, Chi On critical graphs for Opsut’s conjecture. (English) Zbl 0770.05052 Ars Comb. 34, 183-203 (1992). MSC: 05C20 PDFBibTeX XMLCite \textit{C. Wang}, Ars Comb. 34, 183--203 (1992; Zbl 0770.05052)
Ma, Tze-Heng; Spinrad, Jeremy P. Avoiding matrix multiplication. (English) Zbl 0768.68162 Graph-theoretic concepts in computer science, Proc. Int. Workshop, Berlin/Germany 1990, Lect. Notes Comput. Sci. 484, 61-71 (1992). MSC: 68R10 05C85 05C50 PDFBibTeX XMLCite \textit{T.-H. Ma} and \textit{J. P. Spinrad}, Lect. Notes Comput. Sci. 484, 61--71 (1992; Zbl 0768.68162)
Bein, Wolfgang W.; Kamburowski, Jerzy; Stallmann, Matthias F. M. Optimal reduction of two-terminal directed acyclic graphs. (English) Zbl 0768.68119 SIAM J. Comput. 21, No. 6, 1112-1129 (1992). Reviewer: M.Harminc (Košice) MSC: 68R10 05C20 68Q25 05C75 05C85 68M15 68W10 90B25 90C35 90C39 PDFBibTeX XMLCite \textit{W. W. Bein} et al., SIAM J. Comput. 21, No. 6, 1112--1129 (1992; Zbl 0768.68119) Full Text: DOI
Cohen, Edith Approximate max flow on small depth networks. (English) Zbl 0915.90099 33rd annual symposium on Foundations of computer science (FOCS). Proceedings, Pittsburgh, PA, USA, October 24–27, 1992. Washington, DC: IEEE Computer Society Press, 648-658 (1992). MSC: 90B10 68W15 68Q25 90C27 05C85 65Y05 90C35 PDFBibTeX XMLCite \textit{E. Cohen}, in: 33rd annual symposium on Foundations of computer science (FOCS). Proceedings, Pittsburgh, PA, USA, October 24--27, 1992. Washington, DC: IEEE Computer Society Press. 648--658 (1992; Zbl 0915.90099)
Rodionov, V. I. On the number of labeled acyclic digraphs. (English) Zbl 0761.05050 Discrete Math. 105, No. 1-3, 319-321 (1992). MSC: 05C30 05C20 PDFBibTeX XMLCite \textit{V. I. Rodionov}, Discrete Math. 105, No. 1--3, 319--321 (1992; Zbl 0761.05050) Full Text: DOI