• DML-CZ Home

90B10 Network models, deterministic (15 articles)

• Hu, Chen; Qin, Weiwei; Li, Zhenhua; He, Bing; Liu, Gang: Consensus-based state estimation for multi-agent systems with constraint information. (English). Kybernetika, vol. 53 (2017), issue 3, pp. 545-561
• Fiala, Petr: A Hybrid Procedure for Network Multi-Criteria Systems. (English). Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica, vol. 52 (2013), issue 2, pp. 53-60
• Gago, Silvia; Schlatter, Dirk: Bounded expansion in web graphs. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 50 (2009), issue 2, pp. 181-190
• Nebeský, Ladislav: Signpost systems and spanning trees of graphs. (English). Czechoslovak Mathematical Journal, vol. 56 (2006), issue 3, pp. 885-893
• Pelikán, Jan: Aggregation of networks. (English). Kybernetika, vol. 33 (1997), issue 6, pp. 695-698
• Janiga, Ladislav; Koubek, Václav: Minimum cut in directed planar networks. (English). Kybernetika, vol. 28 (1992), issue 1, pp. 37-49
• Mohar, Bojan; Poljak, Svatopluk: Eigenvalues and the max-cut problem. (English). Czechoslovak Mathematical Journal, vol. 40 (1990), issue 2, pp. 343-352
• Vasilakos, Athanasios V.: On the behaviour of learning algorithms in a changing environment with application to data network routing problem. (English). Kybernetika, vol. 26 (1990), issue 4, pp. 296-307
• Zelinka, Bohdan: Spanning trees of locally finite graphs. (English). Czechoslovak Mathematical Journal, vol. 39 (1989), issue 2, pp. 193-197
• Ibaraki, Toshihide; Poljak, Svatopluk: Three-linking in Eulerian digraphs. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 30 (1989), issue 1, pp. 192
• Roos, C.; Tegze, Miron: An extension of the MS pivoting rule to capacitated network flow problems. (English). Acta Universitatis Carolinae. Mathematica et Physica, vol. 29 (1988), issue 1, pp. 73-88
• Nešetřil, Jaroslav; Poljak, Svatopluk: On the complexity of the subgraph problem. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 26 (1985), issue 2, pp. 415-419
• Neumann, Michael: A Ford-Fulkerson type theorem concerning vector-valued flows in infinite networks. (English). Czechoslovak Mathematical Journal, vol. 34 (1984), issue 1, pp. 156-162
• Neumann, Michael M.: Flows in infinite networks. (English). In: Frolík, Zdeněk (ed.): Proceedings of the 11th Winter School on Abstract Analysis. Circolo Matematico di Palermo, Palermo, 1984. pp. [201]-208
• Adámek, Jiří; Koubek, Václav: Remarks on flows in network with short paths. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 12 (1971), issue 4, pp. 661-667