Mateos, Diego M.; Morana, Federico; Aimar, Hugo A graph complexity measure based on the spectral analysis of the Laplace operator. (English) Zbl 1506.05124 Chaos Solitons Fractals 156, Article ID 111817, 9 p. (2022). MSC: 05C50 05C80 05C82 05C20 92C50 05C90 PDFBibTeX XMLCite \textit{D. M. Mateos} et al., Chaos Solitons Fractals 156, Article ID 111817, 9 p. (2022; Zbl 1506.05124) Full Text: DOI arXiv
Hassan, Asmhan Flieh; Zainy, Zainab Redha The independent compatible edges topology of directed graphs. (English) Zbl 1502.05085 J. Discrete Math. Sci. Cryptography 25, No. 8, 2683-2695 (2022). MSC: 05C20 05C10 54A05 PDFBibTeX XMLCite \textit{A. F. Hassan} and \textit{Z. R. Zainy}, J. Discrete Math. Sci. Cryptography 25, No. 8, 2683--2695 (2022; Zbl 1502.05085) Full Text: DOI
Aragona, R.; Civino, R.; Gavioli, N.; Pugliese, M. An authenticated key scheme over elliptic curves for topological networks. (English) Zbl 1504.94094 J. Discrete Math. Sci. Cryptography 25, No. 8, 2429-2448 (2022). MSC: 94A60 94A62 94C15 05C20 PDFBibTeX XMLCite \textit{R. Aragona} et al., J. Discrete Math. Sci. Cryptography 25, No. 8, 2429--2448 (2022; Zbl 1504.94094) Full Text: DOI arXiv
Arumugam, S.; Bača, Martin; Marr, Alison; Semaničová-Feňovčíková, Andrea; Sugeng, Kiki Ariyanti Note on in-antimagicness and out-antimagicness of digraphs. (English) Zbl 1496.05156 J. Discrete Math. Sci. Cryptography 25, No. 6, 1603-1611 (2022). MSC: 05C78 05C20 PDFBibTeX XMLCite \textit{S. Arumugam} et al., J. Discrete Math. Sci. Cryptography 25, No. 6, 1603--1611 (2022; Zbl 1496.05156) Full Text: DOI
Nettasinghe, Buddhika; Alipourfard, Nazanin; Iota, Stephen; Krishnamurthy, Vikram; Lerman, Kristina Scale-free degree distributions, homophily and the glass ceiling effect in directed networks. (English) Zbl 1497.90060 J. Complex Netw. 10, No. 2, Article ID cnac007, 29 p. (2022). MSC: 90B10 PDFBibTeX XMLCite \textit{B. Nettasinghe} et al., J. Complex Netw. 10, No. 2, Article ID cnac007, 29 p. (2022; Zbl 1497.90060) Full Text: DOI
Boonklurb, Ratinan; Ruamkaew, Natdawan; Singhun, Sirirat Directed edge-graceful labeling of digraph consisting of \(c\) cycles of the same size. (English) Zbl 1487.05227 J. Discrete Math. Sci. Cryptography 25, No. 1, 53-72 (2022). MSC: 05C78 PDFBibTeX XMLCite \textit{R. Boonklurb} et al., J. Discrete Math. Sci. Cryptography 25, No. 1, 53--72 (2022; Zbl 1487.05227) Full Text: DOI
Colucci, Lucas; Győri, Ervin On \(L(2,1)\)-labelings of some products of oriented cycles. (English) Zbl 1497.05236 Math. Found. Comput. 5, No. 1, 67-74 (2022). MSC: 05C78 05C76 05C15 05C20 PDFBibTeX XMLCite \textit{L. Colucci} and \textit{E. Győri}, Math. Found. Comput. 5, No. 1, 67--74 (2022; Zbl 1497.05236) Full Text: DOI arXiv
Babai, Azam; Golpar-Raboky, Effat Resolvent energy of digraphs. (English) Zbl 1507.92134 Iran. J. Math. Chem. 12, No. 3, 139-159 (2021). MSC: 92E10 05C92 05C20 PDFBibTeX XMLCite \textit{A. Babai} and \textit{E. Golpar-Raboky}, Iran. J. Math. Chem. 12, No. 3, 139--159 (2021; Zbl 1507.92134) Full Text: DOI
Mwangi, Paul; Kamaku, Waweru; Nyaga, Lewis The non-negative \(P_0\)-matrix completion problem for \(5\times 5\) matrices specifying digraphs with 5 vertices and 4 arcs for acyclic digraphs. (English) Zbl 1504.05111 Int. J. Adv. Appl. Math. Mech. 9, No. 1, 1-5 (2021). MSC: 05C20 05C21 PDFBibTeX XMLCite \textit{P. Mwangi} et al., Int. J. Adv. Appl. Math. Mech. 9, No. 1, 1--5 (2021; Zbl 1504.05111) Full Text: Link
Gogoshin, Grigoriy; Branciamore, Sergio; Rodin, Andrei S. Synthetic data generation with probabilistic Bayesian networks. (English) Zbl 1501.92035 Math. Biosci. Eng. 18, No. 6, 8603-8621 (2021). MSC: 92C42 92-08 05C90 PDFBibTeX XMLCite \textit{G. Gogoshin} et al., Math. Biosci. Eng. 18, No. 6, 8603--8621 (2021; Zbl 1501.92035) Full Text: DOI
Hammad, Hasanen A.; de la Sen, Manuel; Agarwal, Praveen New coincidence point results for generalized graph-preserving multivalued mappings with applications. (English) Zbl 1494.54048 Adv. Difference Equ. 2021, Paper No. 334, 15 p. (2021). MSC: 54H25 26A33 34A08 47H10 54E40 PDFBibTeX XMLCite \textit{H. A. Hammad} et al., Adv. Difference Equ. 2021, Paper No. 334, 15 p. (2021; Zbl 1494.54048) Full Text: DOI
Mateen, M. Haris; Mahmmod, Muhammad Khalid; Kattan, Doha A.; Ali, Shahbaz A novel approach to find partitions of \(Z_m\) with equal sum subsets via complete graphs. (English) Zbl 1525.05080 AIMS Math. 6, No. 9, 9998-10024 (2021). MSC: 05C25 11A07 05C20 PDFBibTeX XMLCite \textit{M. H. Mateen} et al., AIMS Math. 6, No. 9, 9998--10024 (2021; Zbl 1525.05080) Full Text: DOI
Tanaka, Haruyoshi Convergence of Gibbs measures of a perturbed system of graph iterated functions with degeneration. (English) Zbl 1499.37077 Far East J. Dyn. Syst. 32, No. 2, 105-138 (2020). MSC: 37E25 37D35 PDFBibTeX XMLCite \textit{H. Tanaka}, Far East J. Dyn. Syst. 32, No. 2, 105--138 (2020; Zbl 1499.37077) Full Text: DOI
Saylam, Ahmad; Ali, Kamal Hadj; Fikri, Mustapha Degree centrality of combustion reaction networks for analysing and modelling combustion processes. (English) Zbl 1519.80181 Combust. Theory Model. 24, No. 3, 442-459 (2020). MSC: 80A25 PDFBibTeX XMLCite \textit{A. Saylam} et al., Combust. Theory Model. 24, No. 3, 442--459 (2020; Zbl 1519.80181) Full Text: DOI
Boudabbous, Youssef Two \(\{4, n - 3\}\)-isomorphic \(n\)-vertex digraphs are hereditarily isomorphic. (English) Zbl 1499.05253 Filomat 33, No. 13, 4307-4325 (2019). MSC: 05C20 05C60 PDFBibTeX XMLCite \textit{Y. Boudabbous}, Filomat 33, No. 13, 4307--4325 (2019; Zbl 1499.05253) Full Text: DOI
Gama Dessavre, Adjani; Figueroa, Ana Paulina Hierarchical drawings and classifications. (Spanish) Zbl 1439.05099 Misc. Mat. 67, 73-87 (2018). MSC: 05C20 68R10 PDFBibTeX XMLCite \textit{A. Gama Dessavre} and \textit{A. P. Figueroa}, Misc. Mat. 67, 73--87 (2018; Zbl 1439.05099) Full Text: Link
Ali, Bashir; Inuwa, Adamu Yusuf Coincidence and common fixed points theorems for commuting \(G\)-monotone maps in a complete metric space with graph. (English) Zbl 1490.54029 J. Adv. Math. Stud. 11, No. 3, 537-546 (2018). MSC: 54H25 54E40 54E50 PDFBibTeX XMLCite \textit{B. Ali} and \textit{A. Y. Inuwa}, J. Adv. Math. Stud. 11, No. 3, 537--546 (2018; Zbl 1490.54029)
He, Qing-Bi; Li, Hong-Gang; Jin, Mao-Ming; Duan, Hui-Ming; Zhang, Qing-Hua New necessary and sufficient condition and algorithm for directed Hamiltonian graph based on Boolean determinant theory. (English) Zbl 1495.05164 J. Discrete Math. Sci. Cryptography 20, No. 3, 725-745 (2017). MSC: 05C45 05C20 05C85 PDFBibTeX XMLCite \textit{Q.-B. He} et al., J. Discrete Math. Sci. Cryptography 20, No. 3, 725--745 (2017; Zbl 1495.05164) Full Text: DOI
Caniglia, Caravaggio; Cousino, Benjamin; Cheng, Shih-Chuan; Malik, Davender S.; Mordeson, John N. Intuitionistic fuzzy graphs: weakening and strengthening members of a group. (English) Zbl 1371.05237 J. Fuzzy Math. 24, No. 1, 87-102 (2016). MSC: 05C72 05C25 PDFBibTeX XMLCite \textit{C. Caniglia} et al., J. Fuzzy Math. 24, No. 1, 87--102 (2016; Zbl 1371.05237)
Watanabe, Sennosuke; Watanabe, Yoshihide Min-plus algebra and networks. (English) Zbl 1321.05135 RIMS Kôkyûroku Bessatsu B47, 41-54 (2014). MSC: 05C38 05C12 05C20 05C25 05C82 68R10 68M10 16Y60 PDFBibTeX XMLCite \textit{S. Watanabe} and \textit{Y. Watanabe}, RIMS Kôkyûroku Bessatsu B47, 41--54 (2014; Zbl 1321.05135)
Bindusree, A. R.; Lokesha, V.; Ranjini, P. S.; Bayad, A. Relation connecting Zagreb co-indices on three graph operators. (English) Zbl 1288.05108 Math. Aeterna 3, No. 6, 433-448 (2013). MSC: 05C20 PDFBibTeX XMLCite \textit{A. R. Bindusree} et al., Math. Æterna 3, No. 6, 433--448 (2013; Zbl 1288.05108)
Conde, Josep; Lopez, Nacho; Miret, Josep M. In memoriam: Joan Gimbert (1962–2012). (English) Zbl 1296.01025 AKCE Int. J. Graphs Comb. 10, No. 3, 337-347 (2013). MSC: 01A70 05-03 05C20 05C35 05C50 05C12 PDFBibTeX XMLCite \textit{J. Conde} et al., AKCE Int. J. Graphs Comb. 10, No. 3, 337--347 (2013; Zbl 1296.01025)
Hao, Shuixia; Zeng, Guosun; Tan, Yiming Methods for heterogeneous and reconfigurable task partitioning based on directed acyclic graphs. (Chinese. English summary) Zbl 1265.68117 J. Tongji Univ., Nat. Sci. 39, No. 11, 1693-1698 (2011). MSC: 68R10 PDFBibTeX XMLCite \textit{S. Hao} et al., J. Tongji Univ., Nat. Sci. 39, No. 11, 1693--1698 (2011; Zbl 1265.68117)
Gudiño, E.; Rada, Juan A lower bound for the spectral radius of a digraph. (English) Zbl 1267.05163 Notas Mat. 5, No. 1, 39-48 (2009). MSC: 05C50 05C20 05C35 05C90 15A18 PDFBibTeX XMLCite \textit{E. Gudiño} and \textit{J. Rada}, Notas Mat. 5, No. 1, 39--48 (2009; Zbl 1267.05163)
Lazarev, A. A.; Gafarov, E. R. Transformation of the network graph of scheduling problems with precedence constraints to a planar graph. (English. Russian original) Zbl 1260.90090 Dokl. Math. 79, No. 1, 1-3 (2009); translation from Dokl. Akad. Nauk, Ross. Akad. Nauk 424, No. 1, 7-9 (2009). MSC: 90B35 90B50 05C20 05C62 05C90 PDFBibTeX XMLCite \textit{A. A. Lazarev} and \textit{E. R. Gafarov}, Dokl. Math. 79, No. 1, 1--3 (2009; Zbl 1260.90090); translation from Dokl. Akad. Nauk, Ross. Akad. Nauk 424, No. 1, 7--9 (2009) Full Text: DOI
Howe, Stephen The deprioritised approach to prioritised algorithms. (English) Zbl 1182.05111 Bull. Aust. Math. Soc. 79, No. 3, 523-524 (2009). MSC: 05C80 68W20 05C20 05C69 PDFBibTeX XMLCite \textit{S. Howe}, Bull. Aust. Math. Soc. 79, No. 3, 523--524 (2009; Zbl 1182.05111) Full Text: DOI
Shaheen, Ramy S. Domination number of toroidal grid digraphs. (English) Zbl 1284.05203 Util. Math. 78, 175-184 (2009). MSC: 05C69 05C10 05C20 PDFBibTeX XMLCite \textit{R. S. Shaheen}, Util. Math. 78, 175--184 (2009; Zbl 1284.05203)
Emert, John W.; Nelson, Roger B.; Owens, Frank W. Multiple towers of Hanoi with a directed cycle transition graph. (English) Zbl 1194.05050 Congr. Numerantium 193, 89-95 (2008). MSC: 05C20 05C38 91A46 00A08 PDFBibTeX XMLCite \textit{J. W. Emert} et al., Congr. Numerantium 193, 89--95 (2008; Zbl 1194.05050)
Raman, Venkatesh; Saurabh, Saket Improved fixed parameter tractable algorithms for two “edge” problems: MAXCUT and MAXDAG. (English) Zbl 1183.05084 Inf. Process. Lett. 104, No. 2, 65-72 (2007). MSC: 05C85 PDFBibTeX XMLCite \textit{V. Raman} and \textit{S. Saurabh}, Inf. Process. Lett. 104, No. 2, 65--72 (2007; Zbl 1183.05084) Full Text: DOI
Bao, Yulan; Xu, Xirong; Jirimutu On the gracefulness of the digraphs \(n\cdot \vec C_m\). (English) Zbl 1131.05312 Int. J. Pure Appl. Math. 36, No. 2, 221-227 (2007). MSC: 05C78 05C20 PDFBibTeX XMLCite \textit{Y. Bao} et al., Int. J. Pure Appl. Math. 36, No. 2, 221--227 (2007; Zbl 1131.05312)
Wang, Xin Jun; He, Shuai Tian An exploration of the optimum path in a network with edgeweight and vertex states. (Chinese. English summary) Zbl 1504.05114 Math. Theory Appl. 26, No. 1, 33-34 (2006). MSC: 05C20 05C38 05C82 PDFBibTeX XMLCite \textit{X. J. Wang} and \textit{S. T. He}, Math. Theory Appl. 26, No. 1, 33--34 (2006; Zbl 1504.05114)
Plotnikov, Anatoly D. The lower bound of the number of all-or-none DAGs. (English) Zbl 1171.05340 Adv. Stud. Contemp. Math., Kyungshang 12, No. 2, 323-326 (2006). MSC: 05C20 68R10 PDFBibTeX XMLCite \textit{A. D. Plotnikov}, Adv. Stud. Contemp. Math., Kyungshang 12, No. 2, 323--326 (2006; Zbl 1171.05340)
Siqinbate On the gracefulness of the union of two digraphs \(n{\cdot}\overset{\rightharpoonup}\to C_3\). (Chinese. English summary) Zbl 1493.05269 Math. Pract. Theory 35, No. 2, 172-176 (2005). MSC: 05C78 05C20 PDFBibTeX XMLCite \textit{Siqinbate}, Math. Pract. Theory 35, No. 2, 172--176 (2005; Zbl 1493.05269)
Tošić, Dejan V.; Simić, Slobodan K. Analysis of combinational networks with Mathematica. (English) Zbl 1274.05458 Publ. Elektroteh. Fak., Univ. Beogr., Ser. Mat. 16, 98-109 (2005). MSC: 05C90 05C20 94C05 PDFBibTeX XMLCite \textit{D. V. Tošić} and \textit{S. K. Simić}, Publ. Elektroteh. Fak., Univ. Beogr., Ser. Mat. 16, 98--109 (2005; Zbl 1274.05458)
Il’ina, A. N.; Kreĭnes, E. M.; Mikhalev, A. V.; Shabat, G. B. Bigraphs and dessins d’enfants. (Russian) Zbl 1222.14071 ChebyshevskiĭSb. 6, No. 4(16), 108-118 (2005). MSC: 14H57 05C20 57M15 05C75 14H55 PDFBibTeX XMLCite \textit{A. N. Il'ina} et al., Chebyshevskiĭ Sb. 6, No. 4(16), 108--118 (2005; Zbl 1222.14071)
Li, Hongbo; Zhai, Jingang A parallel algorithm for topological sort in directed graphs. (Chinese. English summary) Zbl 1096.05526 Yantai Norm. Univ. J., Nat. Sci. 21, No. 3, 168-171 (2005). MSC: 05C85 05C20 PDFBibTeX XMLCite \textit{H. Li} and \textit{J. Zhai}, Yantai Norm. Univ. J., Nat. Sci. 21, No. 3, 168--171 (2005; Zbl 1096.05526)
Li, Keqin Scheduling DAGs with random parallel tasks on binarily partitionable systems. (English) Zbl 1121.68327 Int. J. Parallel Emergent Distrib. Syst. 20, No. 2, 85-97 (2005). MSC: 68M20 PDFBibTeX XMLCite \textit{K. Li}, Int. J. Parallel Emergent Distrib. Syst. 20, No. 2, 85--97 (2005; Zbl 1121.68327) Full Text: DOI
Qian, Jianguo; Lin, Xiaoxia On the number of double-arc tournaments. (Chinese. English summary) Zbl 1096.05512 J. Xiamen Univ., Nat. Sci. 43, No. 5, 583-591 (2004). MSC: 05C20 05C30 PDFBibTeX XMLCite \textit{J. Qian} and \textit{X. Lin}, J. Xiamen Univ., Nat. Sci. 43, No. 5, 583--591 (2004; Zbl 1096.05512)
Zhao, Yuhua; Li, Kebai; Ren, Weimin Strong kernel graphic algorithm for searching all essential circuits of simple directed graph. (Chinese. English summary) Zbl 1081.05517 J. Southwest Jiaotong Univ. 39, No. 5, 565-568 (2004). MSC: 05C85 68R10 05C20 PDFBibTeX XMLCite \textit{Y. Zhao} et al., J. Southwest Jiaotong Univ. 39, No. 5, 565--568 (2004; Zbl 1081.05517)
Burdonov, I. B.; Kosachev, A. S.; Kulyamin, V. V. Irredundant algorithms for traversing directed graphs: the nondeterministic case. (English. Russian original) Zbl 1124.68399 Program. Comput. Softw. 30, No. 1, 2-17 (2004); translation from Programmirovanie 2004, No. 1, 4-24 (2004). MSC: 68R10 05C20 68W05 PDFBibTeX XMLCite \textit{I. B. Burdonov} et al., Program. Comput. Softw. 30, No. 1, 2--17 (2004; Zbl 1124.68399); translation from Programmirovanie 2004, No. 1, 4--24 (2004) Full Text: DOI
Siqinbate A further property of gracefulness for the digraph \(n\cdot\overset\rightharpoonup\to C_3\). (Chinese. English summary) Zbl 1493.05268 Math. Pract. Theory 33, No. 2, 44-47 (2003). MSC: 05C78 05C20 PDFBibTeX XMLCite \textit{Siqinbate}, Math. Pract. Theory 33, No. 2, 44--47 (2003; Zbl 1493.05268)
Jirumtu, Sqinbatur On the proof of a conjecture that the directed graph \(n\cdot\overset\rightharpoonup\to C_3\) is a graceful graph. (Chinese. English summary) Zbl 1493.05263 Math. Pract. Theory 30, No. 2, 232-234 (2000). MSC: 05C78 05C20 PDFBibTeX XMLCite \textit{S. Jirumtu}, Math. Pract. Theory 30, No. 2, 232--234 (2000; Zbl 1493.05263)
Liu, Bo Lian A combinatorial proof for the enumeration of functions and functional digraphs. (Chinese. English summary) Zbl 1493.05156 Math. Pract. Theory 30, No. 2, 166-168 (2000). MSC: 05C30 05C20 PDFBibTeX XMLCite \textit{B. L. Liu}, Math. Pract. Theory 30, No. 2, 166--168 (2000; Zbl 1493.05156)
Hasunuma, Toru Completely independent spanning trees in the underlying graph of a line digraph. (English) Zbl 0968.05501 RIMS Kokyuroku 1148, 187-192 (2000). MSC: 05C05 05C20 68R10 PDFBibTeX XMLCite \textit{T. Hasunuma}, RIMS Kokyuroku 1148, 187--192 (2000; Zbl 0968.05501)
Andersson, Pontus Random tournaments and random circuits. (English) Zbl 1514.05001 Uppsala Dissertations in Mathematics 14. Uppsala: Uppsala Univ., Department of Mathematics (Diss.) (ISBN 978-91-506-1380-3). 11 p. (1999). MSC: 05-02 05C20 05C80 PDFBibTeX XMLCite \textit{P. Andersson}, Random tournaments and random circuits. Uppsala: Uppsala Univ., Department of Mathematics (Diss.) (1999; Zbl 1514.05001) Full Text: Link
Vitolo, Paolo The reconstruction of simply disconnected tournaments. (English) Zbl 1219.05099 J. Comb. Inf. Syst. Sci. 24, No. 2-4, 65-77 (1999). MSC: 05C60 05C20 PDFBibTeX XMLCite \textit{P. Vitolo}, J. Comb. Inf. Syst. Sci. 24, No. 2--4, 65--77 (1999; Zbl 1219.05099)
Aldemir, M. Ş.; Bakoğlu, H. On the extremum numbers of \(k\)-circuits in a \(T_n\) tournament. (English) Zbl 1221.05170 J. Fac. Sci., Ege Univ., Ser. A-B 21, No. 2, 71-77 (1998). MSC: 05C20 05C38 05C35 PDFBibTeX XMLCite \textit{M. Ş. Aldemir} and \textit{H. Bakoğlu}, J. Fac. Sci., Ege Univ., Ser. A-B 21, No. 2, 71--77 (1998; Zbl 1221.05170)
Soler Fernández, D. Eulerian tour without \(U\)-turns in a simple digraph. (Catalan. English summary) Zbl 1167.05322 Qüestiió (2) 22, No. 3, 471-489 (1998). MSC: 05C45 05C20 PDFBibTeX XMLCite \textit{D. Soler Fernández}, Qüestiió (2) 22, No. 3, 471--489 (1998; Zbl 1167.05322) Full Text: EuDML Link
von Karger, Burghard; Berghammer, Rudolf Computing kernels in directed bichromatic graphs. (English) Zbl 1336.68206 Inf. Process. Lett. 62, No. 1, 5-11 (1997). MSC: 68R10 03G15 05C15 05C20 91A43 PDFBibTeX XMLCite \textit{B. von Karger} and \textit{R. Berghammer}, Inf. Process. Lett. 62, No. 1, 5--11 (1997; Zbl 1336.68206) Full Text: DOI
Charon, Irène; Germa, Anne; Hudry, Olivier Random generation of tournaments and asymmetric graphs with given out-degrees. (English) Zbl 0974.05502 Eur. J. Oper. Res. 95, No. 2, 411-419 (1996). MSC: 05C20 90C27 90C35 05C80 PDFBibTeX XMLCite \textit{I. Charon} et al., Eur. J. Oper. Res. 95, No. 2, 411--419 (1996; Zbl 0974.05502) Full Text: DOI
Eades, Peter Edge crossings in layered drawings of graphs. (English) Zbl 0925.05033 Z. Angew. Math. Mech. 76, Suppl. 3, 47-50 (1996). MSC: 05C20 05C10 68R10 PDFBibTeX XMLCite \textit{P. Eades}, Z. Angew. Math. Mech. 76, 47--50 (1996; Zbl 0925.05033)
Pang, Mingxian; Sun, Yuxiang Equivalent representations of \(M\)-matrices. (Chinese) Zbl 0949.15502 Math. Appl. 8, No. 1, 44-50 (1995). MSC: 15B57 PDFBibTeX XMLCite \textit{M. Pang} and \textit{Y. Sun}, Math. Appl. 8, No. 1, 44--50 (1995; Zbl 0949.15502)
Raspaud, André Good and semi-strong colorings of oriented planar graphs. (English) Zbl 1023.05501 Bull. EATCS 50, 260-263 (1993). MSC: 05C15 05C10 05C20 PDFBibTeX XMLCite \textit{A. Raspaud}, Bull. EATCS 50, 260--263 (1993; Zbl 1023.05501)
Ben-Natan, Ron; Barak, Amnon Parallel contractions of grids for task assignment to processor networks. (English) Zbl 0800.68173 Networks 22, No. 6, 539-562 (1992). MSC: 68M10 68R10 05C20 PDFBibTeX XMLCite \textit{R. Ben-Natan} and \textit{A. Barak}, Networks 22, No. 6, 539--562 (1992; Zbl 0800.68173) Full Text: DOI
Brocka, Bruce Implementation of deadlock analysis in data flow graphs. (English) Zbl 0800.68193 J. Inf. Optim. Sci. 13, No. 1, 73-83 (1992). MSC: 68M15 68P05 68R10 05C20 PDFBibTeX XMLCite \textit{B. Brocka}, J. Inf. Optim. Sci. 13, No. 1, 73--83 (1992; Zbl 0800.68193) Full Text: DOI
Alekseev, D. A. A method of constructing minimal failure cuts. (English. Russian original) Zbl 0800.68616 Cybernetics 27, No. 3, 320-323 (1991); translation from Kibernetika 1991, No. 3, 8-10, 31 (1991). MSC: 68R10 68P10 68M10 68M15 PDFBibTeX XMLCite \textit{D. A. Alekseev}, Cybernetics 27, No. 3, 320--323 (1991; Zbl 0800.68616); translation from Kibernetika 1991, No. 3, 8--10, 31 (1991) Full Text: DOI
Lavrik, V. N. Graph algorithmic algebra. (English. Russian original) Zbl 0800.68611 Cybernetics 24, No. 5, 548-554 (1988); translation from Kibernetika 1988, No. 5, 9-13,21 (1988). MSC: 68R10 68N01 PDFBibTeX XMLCite \textit{V. N. Lavrik}, Cybernetics 24, No. 5, 548--554 (1988; Zbl 0800.68611); translation from Kibernetika 1988, No. 5, 9--13,21 (1988) Full Text: DOI
Gabow, Harold N. Scheduling UET systems on two uniform processors and length two pipelines. (English) Zbl 0651.68039 SIAM J. Comput. 17, No. 4, 810-829 (1988). MSC: 68M20 90B35 68N99 68R10 PDFBibTeX XMLCite \textit{H. N. Gabow}, SIAM J. Comput. 17, No. 4, 810--829 (1988; Zbl 0651.68039) Full Text: DOI
Escudero, M.; Fàbrega, J.; Morillo, P. Fault-tolerant routings in double-loop networks. (English) Zbl 0648.94024 Ars Comb. 25A, 187-198 (1988). MSC: 94C15 05C20 PDFBibTeX XMLCite \textit{M. Escudero} et al., Ars Comb. 25A, 187--198 (1988; Zbl 0648.94024)
Berge, Claude Survey on problems and results about optimal path-partitions in a directed graph. (English) Zbl 0744.05016 Sci., Ser. A 2, 13-15 (1988). MSC: 05C20 05C38 PDFBibTeX XMLCite \textit{C. Berge}, Sci., Ser. A 2, 13--15 (1988; Zbl 0744.05016)
Pitt, Leonard A note on extending Knuth’s tree estimator to directed acyclic graphs. (English) Zbl 0653.68059 Inf. Process. Lett. 24, 203-206 (1987). MSC: 68P10 68R10 68T20 68P05 PDFBibTeX XMLCite \textit{L. Pitt}, Inf. Process. Lett. 24, 203--206 (1987; Zbl 0653.68059) Full Text: DOI
Xiao, Jinsheng The algorithms about shortest paths. (Chinese. English summary) Zbl 0649.05040 Acta Sci. Nat. Univ. Sunyatseni 1987, No. 3, 42-47 (1987). MSC: 05C38 05C35 68R10 PDFBibTeX XMLCite \textit{J. Xiao}, Acta Sci. Nat. Univ. Sunyatseni 1987, No. 3, 42--47 (1987; Zbl 0649.05040)
Robinson, Robert W. Counting strong digraphs. (English) Zbl 0382.05035 J. Graph Theory 1, 189-190 (1977). MSC: 05C30 05C20 PDFBibTeX XMLCite \textit{R. W. Robinson}, J. Graph Theory 1, 189--190 (1977; Zbl 0382.05035) Full Text: DOI
Pukhov, G. E.; Sharashidze, G. K. Simulation principle for combinatorial problems of finite mathematics. (English. Russian original) Zbl 0382.05037 Sov. Phys., Dokl. 20(1975), 810-811 (1976); translation from Dokl. Akad. Nauk SSSR 225, 1038-1040 (1975). MSC: 05C35 05C20 05-04 PDFBibTeX XML
Gassman, Larry D.; Entringer, R. C.; Gilbert, John R.; Lonz, Stephen A.; Vucenic, Wayne Geodetic orientations of complete \(k\)-partite graphs. (English) Zbl 0283.05103 J. Comb. Theory, Ser. B 19, 214-238 (1975). MSC: 05C20 05C35 PDFBibTeX XMLCite \textit{L. D. Gassman} et al., J. Comb. Theory, Ser. B 19, 214--238 (1975; Zbl 0283.05103) Full Text: DOI
Fulkerson, D. R. Packing rooted directed cuts in a weighted directed graph. (English) Zbl 0283.05104 Math. Program. 6, 1-13 (1974). MSC: 05C20 05-04 90C05 90C35 05C35 PDFBibTeX XMLCite \textit{D. R. Fulkerson}, Math. Program. 6, 1--13 (1974; Zbl 0283.05104) Full Text: DOI