Alon, N.; Yuster, R.; Zwick, U. Finding and counting given length cycles. (English) Zbl 0865.68093 Algorithmica 17, No. 3, 209-223 (1997). MSC: 68R10 PDFBibTeX XMLCite \textit{N. Alon} et al., Algorithmica 17, No. 3, 209--223 (1997; Zbl 0865.68093) Full Text: DOI
Yamada, Takeo; Takahashi, Hideo; Kataoka, Seiji A branch-and-bound algorithm for the mini-max spanning forest problem. (English) Zbl 0921.90144 Eur. J. Oper. Res. 101, No. 1, 93-103 (1997). MSC: 90C35 90C60 PDFBibTeX XMLCite \textit{T. Yamada} et al., Eur. J. Oper. Res. 101, No. 1, 93--103 (1997; Zbl 0921.90144) Full Text: DOI
Bacsó, Gábor; Tuza, Zsolt Dominating subgraphs of small diameter. (English) Zbl 0913.90257 J. Comb. Inf. Syst. Sci. 22, No. 1, 51-62 (1997). MSC: 90C35 05C35 PDFBibTeX XMLCite \textit{G. Bacsó} and \textit{Z. Tuza}, J. Comb. Inf. Syst. Sci. 22, No. 1, 51--62 (1997; Zbl 0913.90257)
Jörnsten, Kurt; Løkketangen, Arne Tabu search for weighted \(K\)-cardinality trees. (English) Zbl 0909.90265 Asia-Pac. J. Oper. Res. 14, No. 2, 9-26 (1997). MSC: 90C35 90C27 PDFBibTeX XMLCite \textit{K. Jörnsten} and \textit{A. Løkketangen}, Asia-Pac. J. Oper. Res. 14, No. 2, 9--26 (1997; Zbl 0909.90265)
Goles, Eric; Margenstern, Maurice Universality of the chip-firing game. (English) Zbl 0903.68138 Theor. Comput. Sci. 172, No. 1-2, 121-134 (1997). MSC: 68R10 91A46 PDFBibTeX XMLCite \textit{E. Goles} and \textit{M. Margenstern}, Theor. Comput. Sci. 172, No. 1--2, 121--134 (1997; Zbl 0903.68138) Full Text: DOI
Galbiati, Giulia; Morzenti, Angelo; Maffioli, Francesco On the approximability of some Maximum Spanning Tree Problems. (English) Zbl 0912.68146 Theor. Comput. Sci. 181, No. 1, 107-118 (1997). MSC: 68R10 PDFBibTeX XMLCite \textit{G. Galbiati} et al., Theor. Comput. Sci. 181, No. 1, 107--118 (1997; Zbl 0912.68146) Full Text: DOI
Li, Qiao; Zhang, Yi Restricted connectivity and restricted fault diameter of undirected Kautz graphs. (Chinese. English summary) Zbl 0903.05034 J. Shanghai Jiaotong Univ. (Chin. Ed.) 31, No. 2, 1-6 (1997). MSC: 05C40 05C20 05C12 PDFBibTeX XMLCite \textit{Q. Li} and \textit{Y. Zhang}, J. Shanghai Jiaotong Univ. (Chin. Ed.) 31, No. 2, 1--6 (1997; Zbl 0903.05034)
Prisner, Erich Bicliques in graphs. II: Recognizing \(k\)-path graphs and underlying graphs of line digraphs. (English) Zbl 0895.68103 Möhring, Rolf H. (ed.), Graph-theoretic concepts in computer science. 23rd international workshop, WG ’97, Berlin, Germany, June 18–20, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1335, 273-287 (1997). MSC: 68R10 05C38 05C75 05C20 PDFBibTeX XMLCite \textit{E. Prisner}, Lect. Notes Comput. Sci. 1335, 273--287 (1997; Zbl 0895.68103)
Karzanov, Alexander V. Multiflows and disjoint paths of minimum total cost. (English) Zbl 0889.90064 Math. Program. 78, No. 2 (B), 219-242 (1997). MSC: 90B10 90C35 PDFBibTeX XMLCite \textit{A. V. Karzanov}, Math. Program. 78, No. 2 (B), 219--242 (1997; Zbl 0889.90064) Full Text: DOI
Hedayat, A. S.; Pesotan, H. Designs for two-level factorial experiments with linear models containing main effects and selected two-factor interactions. (English) Zbl 0904.62091 J. Stat. Plann. Inference 64, No. 1, 109-124 (1997). MSC: 62K15 62K05 05B20 PDFBibTeX XMLCite \textit{A. S. Hedayat} and \textit{H. Pesotan}, J. Stat. Plann. Inference 64, No. 1, 109--124 (1997; Zbl 0904.62091) Full Text: DOI
Yu, Bo; Cheriyan, Joseph The node multiterminal cut polyhedron. (English) Zbl 0885.90113 Networks 30, No. 2, 133-148 (1997). MSC: 90C35 PDFBibTeX XMLCite \textit{B. Yu} and \textit{J. Cheriyan}, Networks 30, No. 2, 133--148 (1997; Zbl 0885.90113) Full Text: DOI
De Salvo, Mario; Lo Faro, Giovanni Wrapping graphs and partial semi-hypergroups. (English) Zbl 0885.05105 J. Inf. Optim. Sci. 18, No. 1, 157-166 (1997). Reviewer: M.Demlová (Praha) MSC: 05C99 20N20 PDFBibTeX XMLCite \textit{M. De Salvo} and \textit{G. Lo Faro}, J. Inf. Optim. Sci. 18, No. 1, 157--166 (1997; Zbl 0885.05105) Full Text: DOI
Jagota, Arun K.; Regan, Kenneth W. Performance of neural net heuristics for maximum clique on diverse highly compressible graphs. (English) Zbl 0881.90122 J. Glob. Optim. 10, No. 4, 439-465 (1997). MSC: 90C35 68T05 90C27 PDFBibTeX XMLCite \textit{A. K. Jagota} and \textit{K. W. Regan}, J. Glob. Optim. 10, No. 4, 439--465 (1997; Zbl 0881.90122) Full Text: DOI
van Dam, Edwin R. Graphs, distances and eigenvalues. (English) Zbl 0880.90129 Klein Haneveld, W. K. (ed.) et al., Ten years LNMB. Ph.D. research and graduate courses of the Dutch network of operations research. Amsterdam: CWI. CWI Tracts. 122, 19-22 (1997). MSC: 90C35 PDFBibTeX XMLCite \textit{E. R. van Dam}, in: Ten years LNMB. Ph.D. research and graduate courses of the Dutch network of operations research. Amsterdam: CWI. 19--22 (1997; Zbl 0880.90129)
Padberg, Manfred; Sung, Ting-Yi An analytic symmetrization of max flow-min cut. (English) Zbl 0873.90029 Discrete Math. 165-166, 531-545 (1997). MSC: 90B10 PDFBibTeX XMLCite \textit{M. Padberg} and \textit{T.-Y. Sung}, Discrete Math. 165--166, 531--545 (1997; Zbl 0873.90029) Full Text: DOI
Hamidoune, Yahya Ould; Las Vergnas, Michel Directed switching games. II: The arborescence game. (English) Zbl 0873.90138 Discrete Math. 165-166, 395-402 (1997). MSC: 91A43 PDFBibTeX XMLCite \textit{Y. O. Hamidoune} and \textit{M. Las Vergnas}, Discrete Math. 165--166, 395--402 (1997; Zbl 0873.90138) Full Text: DOI
Bauer, Petra The circuit polytope: Facets. (English) Zbl 0871.90099 Math. Oper. Res. 22, No. 1, 110-145 (1997). MSC: 90C35 90B06 52B12 90C10 90C27 PDFBibTeX XMLCite \textit{P. Bauer}, Math. Oper. Res. 22, No. 1, 110--145 (1997; Zbl 0871.90099) Full Text: DOI
Shioura, Akiyoshi; Tamura, Akihisa; Uno, Takeaki An optimal algorithm for scanning all spanning trees of undirected graphs. (English) Zbl 0870.05066 SIAM J. Comput. 26, No. 3, 678-692 (1997). MSC: 05C85 68R10 05C05 PDFBibTeX XMLCite \textit{A. Shioura} et al., SIAM J. Comput. 26, No. 3, 678--692 (1997; Zbl 0870.05066) Full Text: DOI
Karger, David R.; Motwani, Rajeev An \(\mathcal{NC}\) algorithm for minimum cuts. (English) Zbl 0870.68081 SIAM J. Comput. 26, No. 1, 255-272 (1997). MSC: 68W15 68Q25 PDFBibTeX XMLCite \textit{D. R. Karger} and \textit{R. Motwani}, SIAM J. Comput. 26, No. 1, 255--272 (1997; Zbl 0870.68081) Full Text: DOI
Karger, D.; Motwani, R.; Ramkumar, G. D. S. On approximating the longest path in a graph. (English) Zbl 0876.68083 Algorithmica 18, No. 1, 82-98 (1997). MSC: 68R10 05C38 68Q17 68W25 PDFBibTeX XMLCite \textit{D. Karger} et al., Algorithmica 18, No. 1, 82--98 (1997; Zbl 0876.68083) Full Text: DOI