Abbaas, Omar; Ventura, Jose A. An edge scanning method for the continuous deviation-flow refueling station location problem on a general network. (English) Zbl 1528.90131 Networks 79, No. 3, 264-291 (2022). MSC: 90B80 90B06 PDFBibTeX XMLCite \textit{O. Abbaas} and \textit{J. A. Ventura}, Networks 79, No. 3, 264--291 (2022; Zbl 1528.90131) Full Text: DOI
Saho, Masahide; Shigeno, Maiko Cancel-and-tighten algorithm for quickest flow problems. (English) Zbl 1390.90122 Networks 69, No. 2, 179-188 (2017). MSC: 90B10 PDFBibTeX XMLCite \textit{M. Saho} and \textit{M. Shigeno}, Networks 69, No. 2, 179--188 (2017; Zbl 1390.90122) Full Text: DOI
Adasme, Pablo; Andrade, Rafael; Letournel, Marc; Lisser, Abdel Stochastic maximum weight forest problem. (English) Zbl 1390.90402 Networks 65, No. 4, 289-305 (2015). MSC: 90C15 90C59 PDFBibTeX XMLCite \textit{P. Adasme} et al., Networks 65, No. 4, 289--305 (2015; Zbl 1390.90402) Full Text: DOI
Boros, Endre; Heggernes, Pinar; van’t Hof, Pim; Milanič, Martin Vector connectivity in graphs. (English) Zbl 1386.05096 Networks 63, No. 4, 277-285 (2014). MSC: 05C40 05C85 05C05 68Q25 PDFBibTeX XMLCite \textit{E. Boros} et al., Networks 63, No. 4, 277--285 (2014; Zbl 1386.05096) Full Text: DOI Link
Shen, Siqian; Smith, J. Cole Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs. (English) Zbl 1251.90376 Networks 60, No. 2, 103-119 (2012). MSC: 90C35 05C85 68R10 90C39 PDFBibTeX XMLCite \textit{S. Shen} and \textit{J. C. Smith}, Networks 60, No. 2, 103--119 (2012; Zbl 1251.90376) Full Text: DOI
Cui, Tingting; Hochbaum, Dorit S. Complexity of some inverse shortest path lengths problems. (English) Zbl 1208.05141 Networks 56, No. 1, 20-29 (2010). MSC: 05C85 05C38 05C35 68Q25 PDFBibTeX XMLCite \textit{T. Cui} and \textit{D. S. Hochbaum}, Networks 56, No. 1, 20--29 (2010; Zbl 1208.05141) Full Text: DOI
Çalişkan, Cenk On a capacity scaling algorithm for the constrained maximum flow problem. (English) Zbl 1176.90064 Networks 53, No. 3, 229-230 (2009). MSC: 90B10 90B70 PDFBibTeX XMLCite \textit{C. Çalişkan}, Networks 53, No. 3, 229--230 (2009; Zbl 1176.90064) Full Text: DOI Link
van den Heuvel, Jan; Johnson, Matthew Transversals of subtree hypergraphs and the source location problem in digraphs. (English) Zbl 1180.05116 Networks 51, No. 2, 113-119 (2008). MSC: 05C85 05C65 05C20 90B80 PDFBibTeX XMLCite \textit{J. van den Heuvel} and \textit{M. Johnson}, Networks 51, No. 2, 113--119 (2008; Zbl 1180.05116) Full Text: DOI Link
Chen, Yen Hung; Wu, Bang Ye; Tang, Chuan Yi Approximation algorithms for some \(k\)-source shortest paths spanning tree problems. (English) Zbl 1103.68137 Networks 47, No. 3, 147-156 (2006). MSC: 68W25 90C27 PDFBibTeX XMLCite \textit{Y. H. Chen} et al., Networks 47, No. 3, 147--156 (2006; Zbl 1103.68137) Full Text: DOI
Ishii, Toshimasa; Nagamochi, Hiroshi; Ibaraki, Toshihide Multigraph augmentation under biconnectivity and general edge-connectivity requirements. (English) Zbl 0974.05048 Networks 37, No. 3, 144-155 (2001). MSC: 05C40 05C85 68R10 PDFBibTeX XMLCite \textit{T. Ishii} et al., Networks 37, No. 3, 144--155 (2001; Zbl 0974.05048) Full Text: DOI Link
Sokkalingam, P. T.; Ahuja, Ravindra K.; Orlin, James B. New polynomial-time cycle-canceling algorithms for minimum-cost flows. (English) Zbl 0969.90021 Networks 36, No. 1, 53-63 (2000). MSC: 90B10 05C85 65Y20 PDFBibTeX XMLCite \textit{P. T. Sokkalingam} et al., Networks 36, No. 1, 53--63 (2000; Zbl 0969.90021) Full Text: DOI
Fremuth-Paeger, Christian; Jungnickel, Dieter Balanced network flows. III: Strongly polynomial augmentation algorithms. (English) Zbl 0999.90007 Networks 33, No. 1, 43-56 (1999). Reviewer: Matthias Ehrgott (Auckland) MSC: 90B10 90C35 05C70 PDFBibTeX XMLCite \textit{C. Fremuth-Paeger} and \textit{D. Jungnickel}, Networks 33, No. 1, 43--56 (1999; Zbl 0999.90007) Full Text: DOI
Brazil, M.; Thomas, D. A.; Weng, J. F. A polynomial time algorithm for rectilinear Steiner trees with terminals constrained to curves. (English) Zbl 0918.90133 Networks 33, No. 2, 145-155 (1999). MSC: 90C35 90C60 PDFBibTeX XMLCite \textit{M. Brazil} et al., Networks 33, No. 2, 145--155 (1999; Zbl 0918.90133) Full Text: DOI
Hsu, D. Frank; Hu, Xiao-Dong On shortest two-connected Steiner networks with Euclidean distance. (English) Zbl 0990.05078 Networks 32, No. 2, 133-140 (1998). MSC: 05C35 90C35 PDFBibTeX XMLCite \textit{D. F. Hsu} and \textit{X.-D. Hu}, Networks 32, No. 2, 133--140 (1998; Zbl 0990.05078) Full Text: DOI
Coullard, Collette R.; Gardner, L. Leslie; Wagner, Donald K. Minimum-weighted cycles in 3-separable graphs. (English) Zbl 0877.05054 Networks 29, No. 3, 151-160 (1997). MSC: 05C85 68R10 05C38 05C70 68Q25 PDFBibTeX XMLCite \textit{C. R. Coullard} et al., Networks 29, No. 3, 151--160 (1997; Zbl 0877.05054) Full Text: DOI
Xue, Jue Edge-maximal triangulated subgraphs and heuristics for the maximum clique problem. (English) Zbl 0791.90065 Networks 24, No. 2, 109-120 (1994). MSC: 90C35 PDFBibTeX XMLCite \textit{J. Xue}, Networks 24, No. 2, 109--120 (1994; Zbl 0791.90065) Full Text: DOI
Ervolina, Thomas R.; McCormick, S. Thomas Cancelling most helpful total cuts for minimum cost network flow. (English) Zbl 0781.90034 Networks 23, No. 1, 41-52 (1993). MSC: 90B10 90C60 90-08 PDFBibTeX XMLCite \textit{T. R. Ervolina} and \textit{S. T. McCormick}, Networks 23, No. 1, 41--52 (1993; Zbl 0781.90034) Full Text: DOI
Tamir, Arie; Lowe, Timothy J. The generalized \(p\)-forest problem on a tree network. (English) Zbl 0772.90057 Networks 22, No. 3, 217-230 (1992). MSC: 90B80 90C35 90C60 PDFBibTeX XMLCite \textit{A. Tamir} and \textit{T. J. Lowe}, Networks 22, No. 3, 217--230 (1992; Zbl 0772.90057) Full Text: DOI
Yang, Chengen; Jin, Dayong A primal-dual algorithm for the minimum average weighted length circuit problem. (English) Zbl 0743.90109 Networks 21, No. 7, 705-712 (1991). Reviewer: J.Kamburowski (Toledo) MSC: 90C35 90C60 PDFBibTeX XMLCite \textit{C. Yang} and \textit{D. Jin}, Networks 21, No. 7, 705--712 (1991; Zbl 0743.90109) Full Text: DOI
Wagner, Donald K. Disjoint (s, t)-cuts in a network. (English) Zbl 0744.90093 Networks 20, No. 4, 361-371 (1990). Reviewer: D.Kleitman (Cambridge/Mass.) MSC: 90C35 90B10 90-08 90C05 PDFBibTeX XMLCite \textit{D. K. Wagner}, Networks 20, No. 4, 361--371 (1990; Zbl 0744.90093) Full Text: DOI
Cai, Guo-Ray; Sun, Yu-Geng The minimum augmentation of any graph to a K-edge connected graph. (English) Zbl 0672.05057 Networks 19, No. 1, 151-172 (1989). Reviewer: T.Walsh MSC: 05C40 68R10 PDFBibTeX XMLCite \textit{G.-R. Cai} and \textit{Y.-G. Sun}, Networks 19, No. 1, 151--172 (1989; Zbl 0672.05057) Full Text: DOI
Provan, J. Scott Convexity and the Steiner tree problem. (English) Zbl 0645.90091 Networks 18, No. 1, 55-72 (1988). Reviewer: M.Savelsberg MSC: 90C35 05C05 68Q25 PDFBibTeX XMLCite \textit{J. S. Provan}, Networks 18, No. 1, 55--72 (1988; Zbl 0645.90091) Full Text: DOI
Bertossi, A. A.; Carraresi, P.; Gallo, G. On some matching problems arising in vehicle scheduling models. (English) Zbl 0646.90042 Networks 17, No. 3, 271-281 (1987). MSC: 90B35 68Q25 65K05 90C10 PDFBibTeX XMLCite \textit{A. A. Bertossi} et al., Networks 17, No. 3, 271--281 (1987; Zbl 0646.90042) Full Text: DOI
Conforti, Michele; Cornuejols, Gerard An algorithmic framework for the matching problem in some hypergraphs. (English) Zbl 0645.90093 Networks 17, No. 4, 365-386 (1987). MSC: 90C35 05C70 68Q25 PDFBibTeX XMLCite \textit{M. Conforti} and \textit{G. Cornuejols}, Networks 17, No. 4, 365--386 (1987; Zbl 0645.90093) Full Text: DOI
Cheng, Chung-Kuan Linear placement algorithms and applications to VLSI design. (English) Zbl 0642.90059 Networks 17, No. 4, 439-464 (1987). MSC: 90B35 90B30 65K05 PDFBibTeX XMLCite \textit{C.-K. Cheng}, Networks 17, No. 4, 439--464 (1987; Zbl 0642.90059) Full Text: DOI
Choukhmane, Elarbi; Franco, John An approximation algorithm for the maximum independent set problem in cubic planar graphs. (English) Zbl 0644.90093 Networks 16, No. 4, 349-356 (1986). MSC: 90C35 68Q25 PDFBibTeX XMLCite \textit{E. Choukhmane} and \textit{J. Franco}, Networks 16, No. 4, 349--356 (1986; Zbl 0644.90093) Full Text: DOI
Hansen, Pierre; Thisse, Jacques-François; Wendell, Richard E. Efficient points on a network. (English) Zbl 0644.90029 Networks 16, No. 4, 357-368 (1986). MSC: 90B05 90C35 68Q25 05C05 90C31 PDFBibTeX XMLCite \textit{P. Hansen} et al., Networks 16, No. 4, 357--368 (1986; Zbl 0644.90029) Full Text: DOI
Chung, Fan R. K.; Garey, Michael R.; Tarjan, Robert E. Strongly connected orientations of mixed multigraphs. (English) Zbl 0645.90097 Networks 15, No. 4, 477-484 (1985). MSC: 90C35 68Q25 PDFBibTeX XMLCite \textit{F. R. K. Chung} et al., Networks 15, 477--484 (1985; Zbl 0645.90097) Full Text: DOI
White, Kevin; Farber, Martin; Pulleyblank, William Steiner trees, connected domination and strongly chordal graphs. (English) Zbl 0579.05050 Networks 15, 109-124 (1985). MSC: 05C99 68R10 05C05 PDFBibTeX XMLCite \textit{K. White} et al., Networks 15, 109--124 (1985; Zbl 0579.05050) Full Text: DOI
Ronen, D.; Perl, Y. Heuristics for finding a maximum number of disjoint bounded paths. (English) Zbl 0575.90083 Networks 14, 531-544 (1984). MSC: 90C35 68Q25 05C35 PDFBibTeX XMLCite \textit{D. Ronen} and \textit{Y. Perl}, Networks 14, 531--544 (1984; Zbl 0575.90083) Full Text: DOI
Sysło, Maciej M. On the computational complexity of the minimum-dummy-activities problem in a PERT network. (English) Zbl 0543.90057 Networks 14, 37-45 (1984). MSC: 90B35 90C35 68Q25 05C35 05C20 68R10 PDFBibTeX XMLCite \textit{M. M. Sysło}, Networks 14, 37--45 (1984; Zbl 0543.90057) Full Text: DOI
Orlin, James B. Dynamic matchings and quasidynamic fractional matchings. I. (English) Zbl 0526.90089 Networks 13, 551-562 (1983). MSC: 90C35 90C10 65K05 68Q25 PDFBibTeX XMLCite \textit{J. B. Orlin}, Networks 13, 551--562 (1983; Zbl 0526.90089) Full Text: DOI
Perl, Yehoshua; Snir, Marc Circuit partitioning with size and connection constraints. (English) Zbl 0521.68035 Networks 13, 365-375 (1983). MSC: 68Q25 90C39 05C70 68R10 05C05 94C15 PDFBibTeX XMLCite \textit{Y. Perl} and \textit{M. Snir}, Networks 13, 365--375 (1983; Zbl 0521.68035) Full Text: DOI
Gavril, Fanica; Tamari, Robert An algorithm for constructing edge-trees from hypergraphs. (English) Zbl 0521.05049 Networks 13, 377-388 (1983). MSC: 05C65 68W99 PDFBibTeX XMLCite \textit{F. Gavril} and \textit{R. Tamari}, Networks 13, 377--388 (1983; Zbl 0521.05049) Full Text: DOI
Zemel, Eitan Polynomial algorithms for estimating network reliability. (English) Zbl 0494.90034 Networks 12, 439-452 (1982). MSC: 90B25 90C90 68Q25 PDFBibTeX XMLCite \textit{E. Zemel}, Networks 12, 439--452 (1982; Zbl 0494.90034) Full Text: DOI Link
Tsukiyama, Shuji; Kuh, Ernest S. Double-row planar routing and permutation layout. (English) Zbl 0489.94040 Networks 12, 287-316 (1982). MSC: 94C99 05A05 90B10 68Q25 68R99 PDFBibTeX XMLCite \textit{S. Tsukiyama} and \textit{E. S. Kuh}, Networks 12, 287--316 (1982; Zbl 0489.94040) Full Text: DOI
Cutler, M.; Riesel, Z. Minimum width 2-layer layout of a multichanneled system. (English) Zbl 0484.68030 Networks 12, 173-189 (1982). MSC: 68Q25 94C15 PDFBibTeX XMLCite \textit{M. Cutler} and \textit{Z. Riesel}, Networks 12, 173--189 (1982; Zbl 0484.68030) Full Text: DOI
Minieka, Edward A polynomial time algorithm for finding the absolute center of a network. (English) Zbl 0738.90045 Networks 11, No. 4, 351-355 (1981). MSC: 90B80 90C35 90C60 PDFBibTeX XMLCite \textit{E. Minieka}, Networks 11, 351--355 (1981; Zbl 0738.90045) Full Text: DOI
Colbourn, Charles J. On testing isomorphism of permutation graphs. (English) Zbl 0459.68031 Networks 11, 13-21 (1981). MSC: 68R10 06A06 PDFBibTeX XMLCite \textit{C. J. Colbourn}, Networks 11, 13--21 (1981; Zbl 0459.68031) Full Text: DOI
Cutler, M. Efficient special case algorithms for the n-line planar traveling salesman problem. (English) Zbl 0442.90094 Networks 10, 183-195 (1980). MSC: 90C35 68Q25 PDFBibTeX XMLCite \textit{M. Cutler}, Networks 10, 183--195 (1980; Zbl 0442.90094) Full Text: DOI