Schieber, Baruch Computing a minimum-weight \(k\)-link path in graphs with the concave Monge property. (English) Zbl 0848.68073 Clarkson, K. (ed.), Proceedings of the 6th annual ACM-SIAM symposium on discrete algorithms, San Francisco, CA, USA, January 22-24, 1995. Philadelphia, PA: SIAM. 405-411 (1995). MSC: 68R10 05C20 68Q25 PDFBibTeX XMLCite \textit{B. Schieber}, in: Proceedings of the 6th annual ACM-SIAM symposium on discrete algorithms, SODA '95, San Francisco, CA, USA, January 22--24, 1995. Philadelphia, PA: SIAM; New York, NY: ACM. 405--411 (1995; Zbl 0848.68073)
Andersson, Steen A.; Madigan, David; Perlman, Michael D.; Triggs, Christopher M. On the relation between conditional independence models determined by finite distributive lattices and by directed acyclic graphs. (English) Zbl 0839.62063 J. Stat. Plann. Inference 48, No. 1, 25-46 (1995). MSC: 62H99 05C90 PDFBibTeX XMLCite \textit{S. A. Andersson} et al., J. Stat. Plann. Inference 48, No. 1, 25--46 (1995; Zbl 0839.62063) Full Text: DOI
Kuzyurin, N. N. Multiprocessor scheduling and combinatorial configurations. (English. Russian original) Zbl 0836.68084 Discrete Math. Appl. 5, No. 1, 63-72 (1995); translation from Diskretn. Mat. 7, No. 1, 77-87 (1995). MSC: 68R10 90B35 PDFBibTeX XMLCite \textit{N. N. Kuzyurin}, Discrete Math. Appl. 5, No. 1, 63--72 (1995; Zbl 0836.68084); translation from Diskretn. Mat. 7, No. 1, 77--87 (1995) Full Text: DOI
Rousseau, C. C. Elementary proof of a counting formula for acyclic bipartite tournaments. (English) Zbl 0836.05004 J. Graph Theory 20, No. 3, 319-322 (1995). Reviewer: L.A.Székely (Budapest) MSC: 05A15 05A05 05A18 05C30 05C20 PDFBibTeX XMLCite \textit{C. C. Rousseau}, J. Graph Theory 20, No. 3, 319--322 (1995; Zbl 0836.05004) Full Text: DOI
Madigan, David; York, Jeremy Bayesian graphical models for discrete data. (English) Zbl 0834.62003 Int. Stat. Rev. 63, No. 2, 215-232 (1995). MSC: 62A01 62A09 05C90 PDFBibTeX XMLCite \textit{D. Madigan} and \textit{J. York}, Int. Stat. Rev. 63, No. 2, 215--232 (1995; Zbl 0834.62003) Full Text: DOI
Prodinger, Helmut Comments on the analysis of parameters in a random graph model. (English) Zbl 0834.68091 RAIRO, Inform. Théor. Appl. 29, No. 3, 245-253 (1995). MSC: 68R10 68W10 PDFBibTeX XMLCite \textit{H. Prodinger}, RAIRO, Inform. Théor. Appl. 29, No. 3, 245--253 (1995; Zbl 0834.68091) Full Text: DOI EuDML
Aigner, Martin; Triesch, Eberhard; Tuza, Zsolt Searching for acyclic orientations of graphs. (English) Zbl 0831.05033 Discrete Math. 144, No. 1-3, 3-10 (1995). Reviewer: W.G.Brown (Montreal) MSC: 05C20 05C35 05C38 91A43 PDFBibTeX XMLCite \textit{M. Aigner} et al., Discrete Math. 144, No. 1--3, 3--10 (1995; Zbl 0831.05033) Full Text: DOI
Cohen, Edith Approximate max-flow on small depth networks. (English) Zbl 0837.90041 SIAM J. Comput. 24, No. 3, 579-597 (1995). MSC: 90B10 65Y05 90C35 68W15 68Q25 90C27 05C85 PDFBibTeX XMLCite \textit{E. Cohen}, SIAM J. Comput. 24, No. 3, 579--597 (1995; Zbl 0837.90041) Full Text: DOI
Szwarcfiter, Jayme L. On edge transitivity of directed graphs. (English) Zbl 0824.05055 Discrete Math. 141, No. 1-3, 227-235 (1995). Reviewer: J.W.Moon (Edmonton) MSC: 05C75 05C20 PDFBibTeX XMLCite \textit{J. L. Szwarcfiter}, Discrete Math. 141, No. 1--3, 227--235 (1995; Zbl 0824.05055) Full Text: DOI
Nutov, Zeev; Penn, Michal On the integral dicycle packings and covers and the linear ordering polytope. (English) Zbl 0826.05047 Discrete Appl. Math. 60, No. 1-3, 293-309 (1995). Reviewer: J.W.Moon (Edmonton) MSC: 05C70 05C20 90C05 52B12 68R10 PDFBibTeX XMLCite \textit{Z. Nutov} and \textit{M. Penn}, Discrete Appl. Math. 60, No. 1--3, 293--309 (1995; Zbl 0826.05047) Full Text: DOI
Barthélemy, Jean-Pierre; Hudry, Olivier; Isaak, Garth; Roberts, Fred S.; Tesman, Barry The reversing number of a digraph. (English) Zbl 0826.05032 Discrete Appl. Math. 60, No. 1-3, 39-76 (1995). Reviewer: D.P.Brown (Carbondale) MSC: 05C20 05C35 PDFBibTeX XMLCite \textit{J.-P. Barthélemy} et al., Discrete Appl. Math. 60, No. 1--3, 39--76 (1995; Zbl 0826.05032) Full Text: DOI
Sun, Cha-Hon; Wang, Sheng-De An efficient pruning algorithm for value independent knapsack problem using a DAG structure. (English) Zbl 0827.90110 Comput. Oper. Res. 22, No. 3, 321-334 (1995). MSC: 90C09 PDFBibTeX XMLCite \textit{C.-H. Sun} and \textit{S.-D. Wang}, Comput. Oper. Res. 22, No. 3, 321--334 (1995; Zbl 0827.90110) Full Text: DOI
Anderson, Charles A. Loop and cyclic niche graphs. (English) Zbl 0828.05030 Linear Algebra Appl. 217, 5-13 (1995). Reviewer: W.K.Chen (Chicago) MSC: 05C20 PDFBibTeX XMLCite \textit{C. A. Anderson}, Linear Algebra Appl. 217, 5--13 (1995; Zbl 0828.05030) Full Text: DOI