Aledo, Juan A.; Diaz, Luis G.; Martinez, Silvia; Valverde, Jose C. Attractors and transient in sequential dynamical systems. (English) Zbl 1482.90044 Int. J. Comput. Math. 97, No. 1-2, 467-481 (2020). MSC: 90B10 68R10 94C11 PDFBibTeX XMLCite \textit{J. A. Aledo} et al., Int. J. Comput. Math. 97, No. 1--2, 467--481 (2020; Zbl 1482.90044) Full Text: DOI
Alamgir, Zareen; Karim, Saira; Husnine, Syed Linear-time algorithm for generating c-isolated bicliques. (English) Zbl 1409.68199 Int. J. Comput. Math. 94, No. 8, 1574-1590 (2017). MSC: 68R10 05C69 05C85 68Q25 90C35 PDFBibTeX XMLCite \textit{Z. Alamgir} et al., Int. J. Comput. Math. 94, No. 8, 1574--1590 (2017; Zbl 1409.68199) Full Text: DOI
Lü, Huazhong On extra connectivity and extra edge-connectivity of balanced hypercubes. (English) Zbl 1362.05072 Int. J. Comput. Math. 94, No. 4, 813-820 (2017). MSC: 05C40 05C65 05C90 68R10 PDFBibTeX XMLCite \textit{H. Lü}, Int. J. Comput. Math. 94, No. 4, 813--820 (2017; Zbl 1362.05072) Full Text: DOI
Wang, Mujiangshan; Guo, Yubao; Wang, Shiying The 1-good-neighbour diagnosability of Cayley graphs generated by transposition trees under the PMC model and \(\mathrm{MM}^\ast\) model. (English) Zbl 1362.05062 Int. J. Comput. Math. 94, No. 3, 620-631 (2017). MSC: 05C25 05C70 94C15 68M15 68R10 PDFBibTeX XMLCite \textit{M. Wang} et al., Int. J. Comput. Math. 94, No. 3, 620--631 (2017; Zbl 1362.05062) Full Text: DOI
Lv, Yali; Xiang, Yonghong; Fan, Jianxi Conditional fault-tolerant routing of \((n,k)\)-star graphs. (English) Zbl 1401.68021 Int. J. Comput. Math. 93, No. 10, 1695-1707 (2016). MSC: 68M15 68R10 PDFBibTeX XMLCite \textit{Y. Lv} et al., Int. J. Comput. Math. 93, No. 10, 1695--1707 (2016; Zbl 1401.68021) Full Text: DOI
Safaei, Farshad; Sotoodeh, Hamidreza On the probability of facing random breakdowns: a measure of networks’ vulnerability. (English) Zbl 1342.05006 Int. J. Comput. Math. 93, No. 7, 1045-1073 (2016). MSC: 05A05 05A10 68M15 68R10 94C15 PDFBibTeX XMLCite \textit{F. Safaei} and \textit{H. Sotoodeh}, Int. J. Comput. Math. 93, No. 7, 1045--1073 (2016; Zbl 1342.05006) Full Text: DOI
Wang, Mujiangshan; Yang, Wenguo; Guo, Yubao; Wang, Shiying Conditional fault tolerance in a class of Cayley graphs. (English) Zbl 1338.05124 Int. J. Comput. Math. 93, No. 1, 67-82 (2016). MSC: 05C25 05C70 94C15 68M15 68R10 PDFBibTeX XMLCite \textit{M. Wang} et al., Int. J. Comput. Math. 93, No. 1, 67--82 (2016; Zbl 1338.05124) Full Text: DOI
Al-Saidi, N. M. G.; Rajab, N. A.; Said, M. R. Md.; Kadhim, K. A. Perfect secret sharing scheme based on vertex domination set. (English) Zbl 1325.05123 Int. J. Comput. Math. 92, No. 9, 1755-1763 (2015). MSC: 05C69 05C85 94C15 68R10 PDFBibTeX XMLCite \textit{N. M. G. Al-Saidi} et al., Int. J. Comput. Math. 92, No. 9, 1755--1763 (2015; Zbl 1325.05123) Full Text: DOI Link
Feng, Kai; Wang, Shiying Strong matching preclusion for two-dimensional torus networks. (English) Zbl 1329.68189 Int. J. Comput. Math. 92, No. 3, 473-485 (2015). MSC: 68R10 05C70 05C76 68M15 PDFBibTeX XMLCite \textit{K. Feng} and \textit{S. Wang}, Int. J. Comput. Math. 92, No. 3, 473--485 (2015; Zbl 1329.68189) Full Text: DOI
Lim, Hyeong-Seok; Park, Jung-Heum; Kim, Hee-Chul The bicube: an interconnection of two hypercubes. (English) Zbl 1408.05118 Int. J. Comput. Math. 92, No. 1, 29-40 (2015). MSC: 05C82 05C78 05C12 68M10 68R10 PDFBibTeX XMLCite \textit{H.-S. Lim} et al., Int. J. Comput. Math. 92, No. 1, 29--40 (2015; Zbl 1408.05118) Full Text: DOI
Zhang, Guozhen Arc fault tolerance of Cartesian product digraphs on hyper arc connectivity. (English) Zbl 1307.68058 Int. J. Comput. Math. 91, No. 10, 2152-2162 (2014). MSC: 68R10 05C40 05C76 68M10 68M15 PDFBibTeX XMLCite \textit{G. Zhang}, Int. J. Comput. Math. 91, No. 10, 2152--2162 (2014; Zbl 1307.68058) Full Text: DOI
Kung, Tzu-Liang; Chen, Hon-Chan Improving the panconnectedness property of locally twisted cubes. (English) Zbl 1303.05108 Int. J. Comput. Math. 91, No. 9, 1863-1873 (2014). MSC: 05C45 05C40 05C38 68R10 90B10 PDFBibTeX XMLCite \textit{T.-L. Kung} and \textit{H.-C. Chen}, Int. J. Comput. Math. 91, No. 9, 1863--1873 (2014; Zbl 1303.05108) Full Text: DOI
Cheng, Eddie; Qiu, Ke; Shen, Zhizhang Length two path-centred surface areas for the arrangement graph. (English) Zbl 1302.05038 Int. J. Comput. Math. 91, No. 6, 1170-1189 (2014). MSC: 05C10 05C12 68M10 68R10 68W10 PDFBibTeX XMLCite \textit{E. Cheng} et al., Int. J. Comput. Math. 91, No. 6, 1170--1189 (2014; Zbl 1302.05038) Full Text: DOI
Aledo, Juan A.; Martinez, Silvia; Valverde, Jose C. Parallel dynamical systems over special digraph classes. (English) Zbl 1329.68177 Int. J. Comput. Math. 90, No. 10, 2039-2048 (2013). Reviewer: Jan Baetens (Gent) MSC: 68Q80 37B15 37E15 37N99 68R10 94C10 PDFBibTeX XMLCite \textit{J. A. Aledo} et al., Int. J. Comput. Math. 90, No. 10, 2039--2048 (2013; Zbl 1329.68177) Full Text: DOI
Li, Xianyong; Yang, Xiaofan; He, Li Diagnosability of optical multi-mesh hypercube networks under the comparison diagnosis model. (English) Zbl 1312.68027 Int. J. Comput. Math. 90, No. 9, 1774-1781 (2013). MSC: 68M15 68R10 PDFBibTeX XMLCite \textit{X. Li} et al., Int. J. Comput. Math. 90, No. 9, 1774--1781 (2013; Zbl 1312.68027) Full Text: DOI
Wang, Guoqing; Wang, Haoli; Yang, Yuansheng; Yang, Xuezhi; Zheng, Wenping An upper bound for the crossing number of augmented cubes. (English) Zbl 1281.68167 Int. J. Comput. Math. 90, No. 2, 183-227 (2013). MSC: 68R10 05C10 PDFBibTeX XMLCite \textit{G. Wang} et al., Int. J. Comput. Math. 90, No. 2, 183--227 (2013; Zbl 1281.68167) Full Text: DOI arXiv
Yang, Yuansheng; Zheng, Baigong; Xu, Xirong The crossing number of the generalized Petersen graph \(P(10, 3)\) is six. (English) Zbl 1273.05049 Int. J. Comput. Math. 90, No. 7, 1373-1380 (2013). MSC: 05C10 PDFBibTeX XMLCite \textit{Y. Yang} et al., Int. J. Comput. Math. 90, No. 7, 1373--1380 (2013; Zbl 1273.05049) Full Text: DOI arXiv
Kowaluk, Mirosław; Lingas, Andrzej; Lundell, Eva-Marta Unique subgraphs are not easier to find. (English) Zbl 1310.68113 Int. J. Comput. Math. 90, No. 6, 1247-1253 (2013). MSC: 68R10 68Q25 05C60 05C85 PDFBibTeX XMLCite \textit{M. Kowaluk} et al., Int. J. Comput. Math. 90, No. 6, 1247--1253 (2013; Zbl 1310.68113) Full Text: DOI
Kim, Byeong Moon; Song, Byung Chul; Hwang, Woonjae Distance three labellings for \(K _n\times K_2\). (English) Zbl 1273.05193 Int. J. Comput. Math. 90, No. 5, 906-911 (2013). MSC: 05C78 05C12 05C05 05C51 68R10 68M10 PDFBibTeX XMLCite \textit{B. M. Kim} et al., Int. J. Comput. Math. 90, No. 5, 906--911 (2013; Zbl 1273.05193) Full Text: DOI
Han, Yuejuan; Fan, Jianxi; Zhang, Shukui Changing the diameter of the locally twisted cube. (English) Zbl 1295.68039 Int. J. Comput. Math. 90, No. 3, 497-510 (2013). Reviewer: Jozef Woźniak (Gdańsk) MSC: 68M07 68R10 05C85 65Y05 PDFBibTeX XMLCite \textit{Y. Han} et al., Int. J. Comput. Math. 90, No. 3, 497--510 (2013; Zbl 1295.68039) Full Text: DOI
Derakhshan, Parisa; Hussak, Walter Star graph automorphisms and disjoint Hamilton cycles. (English) Zbl 1273.05116 Int. J. Comput. Math. 90, No. 3, 483-496 (2013). MSC: 05C38 05C45 68R10 PDFBibTeX XMLCite \textit{P. Derakhshan} and \textit{W. Hussak}, Int. J. Comput. Math. 90, No. 3, 483--496 (2013; Zbl 1273.05116) Full Text: DOI
Fu, Jung-Sheng Vertex-pancyclicity of twisted cubes with maximal faulty edges. (English) Zbl 1257.05105 Int. J. Comput. Math. 89, No. 6, 728-740 (2012). MSC: 05C65 05C38 68M10 68R10 PDFBibTeX XMLCite \textit{J.-S. Fu}, Int. J. Comput. Math. 89, No. 6, 728--740 (2012; Zbl 1257.05105) Full Text: DOI
Lee, Jae-Ha; Park, Jung-Heum General-demand disjoint path covers in a graph with faulty elements. (English) Zbl 1257.05073 Int. J. Comput. Math. 89, No. 5, 606-617 (2012). MSC: 05C38 05C40 05C45 05C65 68R10 90B18 PDFBibTeX XMLCite \textit{J.-H. Lee} and \textit{J.-H. Park}, Int. J. Comput. Math. 89, No. 5, 606--617 (2012; Zbl 1257.05073) Full Text: DOI
Zhou, Shuming; Lin, Limei; Xu, Jun-Ming Conditional fault diagnosis of hierarchical hypercubes. (English) Zbl 1255.68045 Int. J. Comput. Math. 89, No. 16, 2152-2164 (2012). MSC: 68M15 68R10 05C40 PDFBibTeX XMLCite \textit{S. Zhou} et al., Int. J. Comput. Math. 89, No. 16, 2152--2164 (2012; Zbl 1255.68045) Full Text: DOI
Lai, Pao-Lien Adaptive diagnosis for torus systems under the comparison model. (English) Zbl 1238.68109 Int. J. Comput. Math. 89, No. 2, 146-159 (2012). MSC: 68R10 68M15 05C38 05C85 PDFBibTeX XMLCite \textit{P.-L. Lai}, Int. J. Comput. Math. 89, No. 2, 146--159 (2012; Zbl 1238.68109) Full Text: DOI
Wang, Xin-Ke; Zhu, Qiang; Feng, Ruitao The diagnosability of the \(k\)-ary \(n\)-cubes using the pessimistic strategy. (English) Zbl 1237.68032 Int. J. Comput. Math. 89, No. 1, 1-10 (2012). MSC: 68M15 68M07 68R10 PDFBibTeX XMLCite \textit{X.-K. Wang} et al., Int. J. Comput. Math. 89, No. 1, 1--10 (2012; Zbl 1237.68032) Full Text: DOI
Xiao, Wenjun; Parhami, Behrooz; Chen, Weidong; He, Mingxin; Wei, Wenhong Biswapped networks: a family of interconnection architectures with advantages over swapped or OTIS networks. (English) Zbl 1237.68025 Int. J. Comput. Math. 88, No. 13, 2669-2684 (2011). MSC: 68M10 68M07 68R10 PDFBibTeX XMLCite \textit{W. Xiao} et al., Int. J. Comput. Math. 88, No. 13, 2669--2684 (2011; Zbl 1237.68025) Full Text: DOI Link
Dong, Qiang; Yang, Xiaofan Fault-tolerant embedding of meshes/tori in twisted cubes. (English) Zbl 1218.68038 Int. J. Comput. Math. 88, No. 8, 1595-1602 (2011). MSC: 68M10 68M15 68R10 PDFBibTeX XMLCite \textit{Q. Dong} and \textit{X. Yang}, Int. J. Comput. Math. 88, No. 8, 1595--1602 (2011; Zbl 1218.68038) Full Text: DOI
Choudum, S. A.; Lavanya, S.; Sunitha, V. Embedding double starlike trees into hypercubes. (English) Zbl 1226.05186 Int. J. Comput. Math. 88, No. 1, 1-5 (2011). MSC: 05C65 05C05 05C10 05C38 68R10 PDFBibTeX XMLCite \textit{S. A. Choudum} et al., Int. J. Comput. Math. 88, No. 1, 1--5 (2011; Zbl 1226.05186) Full Text: DOI
Hsu, Li-Yen; Ling, Feng-I; Kao, Shin-Shin; Cho, Hsun-Jung Ring embedding in faulty generalized honeycomb torus – GHT\((m, n, n/2)\). (English) Zbl 1214.68086 Int. J. Comput. Math. 87, No. 15, 3344-3358 (2010). MSC: 68M15 05C45 05C60 68R10 PDFBibTeX XMLCite \textit{L.-Y. Hsu} et al., Int. J. Comput. Math. 87, No. 15, 3344--3358 (2010; Zbl 1214.68086) Full Text: DOI
Bagheri, Alireza; Razzazi, Mohammadreza Drawing complete binary trees inside rectilinear polygons. (English) Zbl 1214.05089 Int. J. Comput. Math. 87, No. 14, 3138-3148 (2010). MSC: 05C62 05C05 PDFBibTeX XMLCite \textit{A. Bagheri} and \textit{M. Razzazi}, Int. J. Comput. Math. 87, No. 14, 3138--3148 (2010; Zbl 1214.05089) Full Text: DOI
Wang, Fu-Hsing A note on leader election in directed split-stars and directed alternating group graphs. (English) Zbl 1198.05145 Int. J. Comput. Math. 87, No. 11, 2450-2457 (2010). MSC: 05C85 05C20 05C69 05C78 68R10 PDFBibTeX XMLCite \textit{F.-H. Wang}, Int. J. Comput. Math. 87, No. 11, 2450--2457 (2010; Zbl 1198.05145) Full Text: DOI
Cheng, Eddie; Lipták, László; Sherman, David Matching preclusion for the \((n, k)\)-bubble-sort graphs. (English) Zbl 1198.05123 Int. J. Comput. Math. 87, No. 11, 2408-2418 (2010). MSC: 05C70 68R10 PDFBibTeX XMLCite \textit{E. Cheng} et al., Int. J. Comput. Math. 87, No. 11, 2408--2418 (2010; Zbl 1198.05123) Full Text: DOI
Šparl, Petra; Žerovnik, Janez 2-local 7/6-competitive algorithm for multicolouring a sub-class of hexagonal graphs. (English) Zbl 1221.05296 Int. J. Comput. Math. 87, No. 9, 2003-2013 (2010). MSC: 05C85 05C15 68W15 68W25 68R10 PDFBibTeX XMLCite \textit{P. Šparl} and \textit{J. Žerovnik}, Int. J. Comput. Math. 87, No. 9, 2003--2013 (2010; Zbl 1221.05296) Full Text: DOI
Barman, Sambhu Charan; Pal, Madhumangal; Mondal, Sukumar The \(k\)-neighbourhood-covering problem on interval graphs. (English) Zbl 1218.05176 Int. J. Comput. Math. 87, No. 9, 1918-1935 (2010). MSC: 05C85 68W40 68Q25 68R10 PDFBibTeX XMLCite \textit{S. C. Barman} et al., Int. J. Comput. Math. 87, No. 9, 1918--1935 (2010; Zbl 1218.05176) Full Text: DOI
Lin, Cheng-Kuan; Ho, Tung-Yang; Tan, Jimmy J. M.; Hsu, Lih-Hsing Fault-tolerant hamiltonicity and fault-tolerant Hamiltonian connectivity of the folded Petersen cube networks. (English) Zbl 1158.68432 Int. J. Comput. Math. 86, No. 1, 57-66 (2009). MSC: 68R10 PDFBibTeX XMLCite \textit{C.-K. Lin} et al., Int. J. Comput. Math. 86, No. 1, 57--66 (2009; Zbl 1158.68432) Full Text: DOI
Xiao, Wenjun; Parhami, Behrooz On routing and diameter of metacyclic graphs. (English) Zbl 1159.68026 Int. J. Comput. Math. 86, No. 1, 21-30 (2009). MSC: 68R10 PDFBibTeX XMLCite \textit{W. Xiao} and \textit{B. Parhami}, Int. J. Comput. Math. 86, No. 1, 21--30 (2009; Zbl 1159.68026) Full Text: DOI
Criado, R.; Hernández-Bermejo, B.; Marco-Blanco, J.; Romance, M. Probabilistic analysis of efficiency and vulnerability in the Erdös-Rénji model. (English) Zbl 1147.68606 Int. J. Comput. Math. 85, No. 3-4, 411-419 (2008). MSC: 68R10 05C80 94C15 PDFBibTeX XMLCite \textit{R. Criado} et al., Int. J. Comput. Math. 85, No. 3--4, 411--419 (2008; Zbl 1147.68606) Full Text: DOI
Palubeckis, G. On the recursive largest first algorithm for graph colouring. (English) Zbl 1139.05024 Int. J. Comput. Math. 85, No. 2, 191-200 (2008). Reviewer: Václav Koubek (Praha) MSC: 05C15 05C69 05C85 68R10 68W25 90C27 PDFBibTeX XMLCite \textit{G. Palubeckis}, Int. J. Comput. Math. 85, No. 2, 191--200 (2008; Zbl 1139.05024) Full Text: DOI
Fernau, Henning ROMAN DOMINATION: a parameterized perspective. (English) Zbl 1130.05041 Int. J. Comput. Math. 85, No. 1, 25-38 (2008). MSC: 05C69 05C85 68R10 68Q25 01A20 PDFBibTeX XMLCite \textit{H. Fernau}, Int. J. Comput. Math. 85, No. 1, 25--38 (2008; Zbl 1130.05041) Full Text: DOI
Gu, Ming; He, Fei; Cheng, Lerong; Song, Xiaoyu; Yang, Guowu Congestion estimation for hexagonal routing. (English) Zbl 1110.68017 Int. J. Comput. Math. 83, No. 3, 263-272 (2006). MSC: 68M99 68R10 PDFBibTeX XMLCite \textit{M. Gu} et al., Int. J. Comput. Math. 83, No. 3, 263--272 (2006; Zbl 1110.68017) Full Text: DOI
Chen, Yen-Ju; Chang, Jou-Ming; Wang, Yue-Li An efficient algorithm for estimating rotation distance between two binary trees. (English) Zbl 1101.68016 Int. J. Comput. Math. 82, No. 9, 1095-1106 (2005). MSC: 68P05 05C05 68R10 PDFBibTeX XMLCite \textit{Y.-J. Chen} et al., Int. J. Comput. Math. 82, No. 9, 1095--1106 (2005; Zbl 1101.68016) Full Text: DOI
Ho, Ting-Yem; Chang, Jou-Ming An efficient distributed algorithm for finding all hinge vertices in networks. (English) Zbl 1098.68143 Int. J. Comput. Math. 82, No. 7, 821-825 (2005). MSC: 68W15 05C85 68R10 PDFBibTeX XMLCite \textit{T.-Y. Ho} and \textit{J.-M. Chang}, Int. J. Comput. Math. 82, No. 7, 821--825 (2005; Zbl 1098.68143) Full Text: DOI
Saha, Anita; Pal, Madhumangal; Pal, Tapan K. An optimal parallel algorithm to construct a tree 3-spanner on interval graphs. (English) Zbl 1079.68111 Int. J. Comput. Math. 82, No. 3, 259-274 (2005). MSC: 68W10 05C05 05C85 68R10 68W25 68W40 PDFBibTeX XMLCite \textit{A. Saha} et al., Int. J. Comput. Math. 82, No. 3, 259--274 (2005; Zbl 1079.68111) Full Text: DOI
Jin, Zemin; Li, Xueliang The complexity for partitioning graphs by monochromatic trees, cycles and paths. (English) Zbl 1078.05021 Int. J. Comput. Math. 81, No. 11, 1357-1362 (2004). Reviewer: Lai Chunhui (Zhangzhou) MSC: 05C05 68R10 05C15 05C38 PDFBibTeX XMLCite \textit{Z. Jin} and \textit{X. Li}, Int. J. Comput. Math. 81, No. 11, 1357--1362 (2004; Zbl 1078.05021) Full Text: DOI
Bagheri, Alireza; Razzazi, Mohammadreza How to draw free trees inside bounded rectilinear polygons. (English) Zbl 1064.65016 Int. J. Comput. Math. 81, No. 11, 1329-1339 (2004). Reviewer: Dana Petcu (Timişoara) MSC: 65D18 PDFBibTeX XMLCite \textit{A. Bagheri} and \textit{M. Razzazi}, Int. J. Comput. Math. 81, No. 11, 1329--1339 (2004; Zbl 1064.65016) Full Text: DOI
Poranen, Timo A simulated annealing algorithm for the maximum planar subgraph problem. (English) Zbl 1055.05144 Int. J. Comput. Math. 81, No. 5, 555-568 (2004). Reviewer: Ján Plesník (Bratislava) MSC: 05C85 05C10 68R10 90C59 PDFBibTeX XMLCite \textit{T. Poranen}, Int. J. Comput. Math. 81, No. 5, 555--568 (2004; Zbl 1055.05144) Full Text: DOI
Dündar, Pinar; Kiliç, Elgin Finding a fault tolerant routing on neighbour-faulty hypercube. (English) Zbl 1082.68590 Int. J. Comput. Math. 81, No. 9, 1043-1049 (2004). MSC: 68R10 68M15 68M10 90B18 PDFBibTeX XMLCite \textit{P. Dündar} and \textit{E. Kiliç}, Int. J. Comput. Math. 81, No. 9, 1043--1049 (2004; Zbl 1082.68590) Full Text: DOI
Saha, Anita; Pal, Madhumangal Maximum weight \(k\)-independent set problem on permutation graphs. (English) Zbl 1100.68597 Int. J. Comput. Math. 80, No. 12, 1477-1487 (2003). MSC: 68R10 05C69 68W40 90B35 90C35 PDFBibTeX XMLCite \textit{A. Saha} and \textit{M. Pal}, Int. J. Comput. Math. 80, No. 12, 1477--1487 (2003; Zbl 1100.68597) Full Text: DOI
Gerbessiotis, Alexandros V. Random graphs in a neural computation model. (English) Zbl 1045.05513 Int. J. Comput. Math. 80, No. 6, 689-707 (2003). MSC: 05C80 68R10 PDFBibTeX XMLCite \textit{A. V. Gerbessiotis}, Int. J. Comput. Math. 80, No. 6, 689--707 (2003; Zbl 1045.05513) Full Text: DOI
Ahrabian, H.; Nowzari-Dalini, A. Generation of \(t\)-ary trees with Ballot-sequences. (English) Zbl 1041.05069 Int. J. Comput. Math. 80, No. 10, 1243-1249 (2003). MSC: 05C85 06C05 68R10 PDFBibTeX XMLCite \textit{H. Ahrabian} and \textit{A. Nowzari-Dalini}, Int. J. Comput. Math. 80, No. 10, 1243--1249 (2003; Zbl 1041.05069) Full Text: DOI
Loukakis, E. A dynamic programming algorithm to test a signed graph for balance. (English) Zbl 1024.05034 Int. J. Comput. Math. 80, No. 4, 499-507 (2003). Reviewer: Erwin Pesch (Siegen) MSC: 05C22 05C85 68R10 90C39 PDFBibTeX XMLCite \textit{E. Loukakis}, Int. J. Comput. Math. 80, No. 4, 499--507 (2003; Zbl 1024.05034) Full Text: DOI
Mondal, Sukumar; Pal, Madhumangal; Pal, Tapan K. An optimal algorithm to solve 2-neighbourhood covering problem on interval graphs. (English) Zbl 1064.68072 Int. J. Comput. Math. 79, No. 2, 189-204 (2002). MSC: 68R10 05C85 PDFBibTeX XMLCite \textit{S. Mondal} et al., Int. J. Comput. Math. 79, No. 2, 189--204 (2002; Zbl 1064.68072) Full Text: DOI
Bera, Debashis; Pal, Madhumangal; Pal, Tapan K. An efficient algorithm to generate all maximal cliques on trapezoid graphs. (English) Zbl 1001.05109 Int. J. Comput. Math. 79, No. 10, 1057-1065 (2002). Reviewer: Haiko Müller (Leeds) MSC: 05C85 05C69 05C62 68R10 PDFBibTeX XMLCite \textit{D. Bera} et al., Int. J. Comput. Math. 79, No. 10, 1057--1065 (2002; Zbl 1001.05109) Full Text: DOI
Frieder, Ophir; Harary, Frank; Wan, Peng-Jun A radio coloring of a hypercube. (English) Zbl 1001.05053 Int. J. Comput. Math. 79, No. 6, 665-670 (2002). Reviewer: Stanislav Jendrol’ (Košice) MSC: 05C15 68R10 PDFBibTeX XMLCite \textit{O. Frieder} et al., Int. J. Comput. Math. 79, No. 6, 665--670 (2002; Zbl 1001.05053) Full Text: DOI
Abdalla, Ayman; Deo, Narsingh Random-tree diameter and the diameter-constrained MST. (English) Zbl 1008.68086 Int. J. Comput. Math. 79, No. 6, 651-663 (2002). MSC: 68R10 PDFBibTeX XMLCite \textit{A. Abdalla} and \textit{N. Deo}, Int. J. Comput. Math. 79, No. 6, 651--663 (2002; Zbl 1008.68086) Full Text: DOI
Ahrabian, H.; Nowzari-Dalini, A. Parallel algorithms for minimum spanning tree problem. (English) Zbl 1014.68121 Int. J. Comput. Math. 79, No. 4, 441-448 (2002). MSC: 68R10 PDFBibTeX XMLCite \textit{H. Ahrabian} and \textit{A. Nowzari-Dalini}, Int. J. Comput. Math. 79, No. 4, 441--448 (2002; Zbl 1014.68121) Full Text: DOI
Pisanski, Tomaž; Zmazek, Blaž; Žerovnik, Janez An algorithm for \(k\)-convex closure and an application. (English) Zbl 0983.05075 Int. J. Comput. Math. 78, No. 1, 1-11 (2001). MSC: 05C85 05C62 68R10 PDFBibTeX XMLCite \textit{T. Pisanski} et al., Int. J. Comput. Math. 78, No. 1, 1--11 (2001; Zbl 0983.05075) Full Text: DOI
Mäkinen, Erkki On the longest upsequence problem for permutations. (English) Zbl 0976.05002 Int. J. Comput. Math. 77, No. 1, 45-53 (2001). Reviewer: Haiko Müller (Leeds) MSC: 05A05 05C69 05C85 05E10 68R10 68Q25 PDFBibTeX XMLCite \textit{E. Mäkinen}, Int. J. Comput. Math. 77, No. 1, 45--53 (2001; Zbl 0976.05002) Full Text: DOI
Dündar, Pinar Stability measures of some static interconnection networks. (English) Zbl 0984.68117 Int. J. Comput. Math. 76, No. 4, 455-462 (2001). MSC: 68R10 PDFBibTeX XMLCite \textit{P. Dündar}, Int. J. Comput. Math. 76, No. 4, 455--462 (2001; Zbl 0984.68117) Full Text: DOI
Vesel, Aleksander; Žerovnik, Janez On the linear \(k\)-arboricity of cubic graphs. (English) Zbl 0967.68125 Int. J. Comput. Math. 75, No. 4, 431-444 (2000). MSC: 68R10 PDFBibTeX XMLCite \textit{A. Vesel} and \textit{J. Žerovnik}, Int. J. Comput. Math. 75, No. 4, 431--444 (2000; Zbl 0967.68125) Full Text: DOI
Mäkinen, Erkki Constructing a binary tree efficiently from its traversals. (English) Zbl 0962.68139 Int. J. Comput. Math. 75, No. 2, 143-147 (2000). MSC: 68R10 PDFBibTeX XMLCite \textit{E. Mäkinen}, Int. J. Comput. Math. 75, No. 2, 143--147 (2000; Zbl 0962.68139) Full Text: DOI
Shen, Hong Improved parallel algorithms for finding the most vital edge of a graph with respect to minimum spanning tree. (English) Zbl 0962.68178 Int. J. Comput. Math. 75, No. 2, 129-136 (2000). MSC: 68W10 68R10 PDFBibTeX XMLCite \textit{H. Shen}, Int. J. Comput. Math. 75, No. 2, 129--136 (2000; Zbl 0962.68178) Full Text: DOI
Pal, Madhumangal; Mondal, Sukumar; Bera, Debashis; Pal, Tapan K. An optimal parallel algorithm for computing cut vertices and blocks on interval graphs. (English) Zbl 0960.68132 Int. J. Comput. Math. 75, No. 1, 59-70 (2000). MSC: 68R10 68W10 PDFBibTeX XMLCite \textit{M. Pal} et al., Int. J. Comput. Math. 75, No. 1, 59--70 (2000; Zbl 0960.68132) Full Text: DOI
Sarkar, Dilip; Tong, Wing Product networks: A family of symmetric interconnection networks from a group model. (English) Zbl 0947.68019 Int. J. Comput. Math. 73, No. 2, 183-200 (1999). MSC: 68M99 68M07 68R10 PDFBibTeX XMLCite \textit{D. Sarkar} and \textit{W. Tong}, Int. J. Comput. Math. 73, No. 2, 183--200 (1999; Zbl 0947.68019) Full Text: DOI
Bera, Debashis; Pal, Madhumangal; Pal, Tapan K. An optimal parallel algorithm to compute all cut vertices and blocks on permutation graphs. (English) Zbl 0942.68099 Int. J. Comput. Math. 72, No. 4, 449-462 (1999). MSC: 68R10 05C85 68W10 PDFBibTeX XMLCite \textit{D. Bera} et al., Int. J. Comput. Math. 72, No. 4, 449--462 (1999; Zbl 0942.68099) Full Text: DOI
Dündar, Pinar The neighbour-integrity of Boolean graphs and its compounds. (English) Zbl 0942.68098 Int. J. Comput. Math. 72, No. 4, 441-447 (1999). MSC: 68R10 05C40 05C90 68M10 PDFBibTeX XMLCite \textit{P. Dündar}, Int. J. Comput. Math. 72, No. 4, 441--447 (1999; Zbl 0942.68098) Full Text: DOI
Ahrabian, H.; Nowzari-Dalini, A. On the generation of binary trees in \(A\)-order. (English) Zbl 0926.68097 Int. J. Comput. Math. 71, No. 3, 351-357 (1999). MSC: 68R10 05C05 PDFBibTeX XMLCite \textit{H. Ahrabian} and \textit{A. Nowzari-Dalini}, Int. J. Comput. Math. 71, No. 3, 351--357 (1999; Zbl 0926.68097) Full Text: DOI
Dragan, Feodor F.; Nicolai, Falk LexBFS-orderings and powers of HHD-free graphs. (English) Zbl 0934.05110 Int. J. Comput. Math. 71, No. 1, 35-56 (1999). Reviewer: Andreas Brandstädt (Rostock) MSC: 05C75 68R10 PDFBibTeX XMLCite \textit{F. F. Dragan} and \textit{F. Nicolai}, Int. J. Comput. Math. 71, No. 1, 35--56 (1999; Zbl 0934.05110) Full Text: DOI
Frosini, Patrizio; Pittore, Massimiliano New methods for reducing size graphs. (English) Zbl 0916.68111 Int. J. Comput. Math. 70, No. 3, 505-517 (1999). MSC: 68R10 05C99 PDFBibTeX XMLCite \textit{P. Frosini} and \textit{M. Pittore}, Int. J. Comput. Math. 70, No. 3, 505--517 (1999; Zbl 0916.68111) Full Text: DOI
Basagni, Stefano A note on causal trees and their applications to CCS. (English) Zbl 0930.68114 Int. J. Comput. Math. 71, No. 2, 137-159 (1999). MSC: 68R10 PDFBibTeX XMLCite \textit{S. Basagni}, Int. J. Comput. Math. 71, No. 2, 137--159 (1999; Zbl 0930.68114) Full Text: DOI
Hota, Mrinmoy; Pal, Madhumangal; Pal, Tapan K. An efficient algorithm to generate all maximal independent sets on trapezoid graphs. (English) Zbl 0923.68094 Int. J. Comput. Math. 70, No. 4, 587-599 (1999). MSC: 68R10 PDFBibTeX XMLCite \textit{M. Hota} et al., Int. J. Comput. Math. 70, No. 4, 587--599 (1999; Zbl 0923.68094) Full Text: DOI
Ahrabian, H.; Nowzari-Dalini, A. On the generation of binary trees from \((0-1)\) codes. (English) Zbl 0926.68096 Int. J. Comput. Math. 69, No. 3-4, 243-251 (1998). MSC: 68R10 05C05 PDFBibTeX XMLCite \textit{H. Ahrabian} and \textit{A. Nowzari-Dalini}, Int. J. Comput. Math. 69, No. 3--4, 243--251 (1998; Zbl 0926.68096) Full Text: DOI
Yang, Chao; Zhang, Jianzhong A constrained capacity expansion problem on networks. (English) Zbl 0940.68005 Int. J. Comput. Math. 70, No. 1, 19-33 (1998). MSC: 68M10 68R10 PDFBibTeX XMLCite \textit{C. Yang} and \textit{J. Zhang}, Int. J. Comput. Math. 70, No. 1, 19--33 (1998; Zbl 0940.68005) Full Text: DOI
Moriya, Etsuro; Tsugane, Keiko Optimally fast shortest path algorithms for some classes of graphs. (English) Zbl 0918.68080 Int. J. Comput. Math. 70, No. 2, 297-317 (1998). MSC: 68R10 PDFBibTeX XMLCite \textit{E. Moriya} and \textit{K. Tsugane}, Int. J. Comput. Math. 70, No. 2, 297--317 (1998; Zbl 0918.68080) Full Text: DOI
Pal, Madhumangal A parallel algorithm to generate all maximal independent sets on permutation graphs. (English) Zbl 0896.68077 Int. J. Comput. Math. 67, No. 3-4, 261-274 (1998). MSC: 68W15 68R10 68P05 PDFBibTeX XMLCite \textit{M. Pal}, Int. J. Comput. Math. 67, No. 3--4, 261--274 (1998; Zbl 0896.68077) Full Text: DOI
Ivković, Zoran; Sarnath, Ramnath; Sunder, Sivaprakasam Fully dynamic algorithms for permutation graph coloring. (English) Zbl 0865.68091 Int. J. Comput. Math. 63, No. 1-2, 37-55 (1997). MSC: 68R10 PDFBibTeX XMLCite \textit{Z. Ivković} et al., Int. J. Comput. Math. 63, No. 1--2, 37--55 (1997; Zbl 0865.68091) Full Text: DOI
Harary, Frank; Nikolopoulos, Stavros D. On complete systems of invariants for small graphs. (English) Zbl 0874.68241 Int. J. Comput. Math. 64, No. 1-2, 35-46 (1997). MSC: 68R10 PDFBibTeX XMLCite \textit{F. Harary} and \textit{S. D. Nikolopoulos}, Int. J. Comput. Math. 64, No. 1--2, 35--46 (1997; Zbl 0874.68241) Full Text: DOI
Almulla, Mohammed; Newborn, Monroe The practicality of generating semantic trees for proofs of unsatisfiability. (English) Zbl 1001.68513 Int. J. Comput. Math. 62, No. 1-2, 45-61 (1996). MSC: 68Q25 68Q55 68R10 PDFBibTeX XMLCite \textit{M. Almulla} and \textit{M. Newborn}, Int. J. Comput. Math. 62, No. 1--2, 45--61 (1996; Zbl 1001.68513) Full Text: DOI
Pal, Madhumangal; Bhattacharjee, G. P. A sequential algorithm for finding a maximum weight \(K\)-independent set on interval graphs. (English) Zbl 1001.68512 Int. J. Comput. Math. 60, No. 3-4, 205-214 (1996). MSC: 68Q25 68R10 PDFBibTeX XMLCite \textit{M. Pal} and \textit{G. P. Bhattacharjee}, Int. J. Comput. Math. 60, No. 3--4, 205--214 (1996; Zbl 1001.68512) Full Text: DOI
Salehi-Fathabadi, H.; Ahrabian, H. A new algorithm for minimum spanning tree using depth-first-search in an undirected graph. (English) Zbl 0847.68082 Int. J. Comput. Math. 57, No. 3-4, 157-161 (1995). MSC: 68R10 PDFBibTeX XMLCite \textit{H. Salehi-Fathabadi} and \textit{H. Ahrabian}, Int. J. Comput. Math. 57, No. 3--4, 157--161 (1995; Zbl 0847.68082) Full Text: DOI
Lucanu, D. Algebraic structures of directed acyclic graphs: Application to concurrent calculus. (English) Zbl 0847.68080 Int. J. Comput. Math. 57, No. 3-4, 127-156 (1995). MSC: 68R10 68Q10 PDFBibTeX XMLCite \textit{D. Lucanu}, Int. J. Comput. Math. 57, No. 3--4, 127--156 (1995; Zbl 0847.68080) Full Text: DOI
Harary, Frank; Khurrum, Mohammed One node fault tolerance for caterpillars and starlike trees. (English) Zbl 0847.68081 Int. J. Comput. Math. 56, No. 3-4, 135-143 (1995). MSC: 68R10 PDFBibTeX XMLCite \textit{F. Harary} and \textit{M. Khurrum}, Int. J. Comput. Math. 56, No. 3--4, 135--143 (1995; Zbl 0847.68081) Full Text: DOI
Cho, J. H.; Palmer, E. M. On the expected number of edges in a maximum matching of an \((r,s)\)-tree. (English) Zbl 0852.68071 Int. J. Comput. Math. 56, No. 1-2, 39-50 (1995). MSC: 68R10 PDFBibTeX XMLCite \textit{J. H. Cho} and \textit{E. M. Palmer}, Int. J. Comput. Math. 56, No. 1--2, 39--50 (1995; Zbl 0852.68071) Full Text: DOI
Pal, Madhumangal; Bhattacharjee, G. P. Optimal sequential and parallel algorithms for computing the diameter and the center of an interval graph. (English) Zbl 0841.68057 Int. J. Comput. Math. 59, No. 1-2, 1-13 (1995). MSC: 68W15 68R10 PDFBibTeX XMLCite \textit{M. Pal} and \textit{G. P. Bhattacharjee}, Int. J. Comput. Math. 59, No. 1--2, 1--13 (1995; Zbl 0841.68057) Full Text: DOI
Haynes, Teresa W.; Lawson, Linda M. Invariants of \(E\)-graphs. (English) Zbl 0845.68082 Int. J. Comput. Math. 55, No. 1-2, 19-27 (1995). MSC: 68R10 PDFBibTeX XMLCite \textit{T. W. Haynes} and \textit{L. M. Lawson}, Int. J. Comput. Math. 55, No. 1--2, 19--27 (1995; Zbl 0845.68082) Full Text: DOI
Klein, Rolf; Ma, Lihong Wrapping ellipses around a convex skeleton. (English) Zbl 0845.68110 Int. J. Comput. Math. 55, No. 3-4, 173-181 (1995). MSC: 68U05 68R10 PDFBibTeX XMLCite \textit{R. Klein} and \textit{L. Ma}, Int. J. Comput. Math. 55, No. 3--4, 173--181 (1995; Zbl 0845.68110) Full Text: DOI
Hagauer, Johann Skeletons, recognition algorithm and distance matrix of quasi-median graphs. (English) Zbl 0845.68055 Int. J. Comput. Math. 55, No. 3-4, 155-171 (1995). MSC: 68W10 68R10 PDFBibTeX XMLCite \textit{J. Hagauer}, Int. J. Comput. Math. 55, No. 3--4, 155--171 (1995; Zbl 0845.68055) Full Text: DOI
Mäkinen, Erkki; Sieranta, Mika Genetic algorithm for drawing bipartite graphs. (English) Zbl 0839.68072 Int. J. Comput. Math. 53, No. 3-4, 157-166 (1994). MSC: 68R10 68Q25 PDFBibTeX XMLCite \textit{E. Mäkinen} and \textit{M. Sieranta}, Int. J. Comput. Math. 53, No. 3--4, 157--166 (1994; Zbl 0839.68072) Full Text: DOI
Cimikowski, Robert J. Branch-and-bound techniques for the maximum planar subgraph problem. (English) Zbl 0842.68057 Int. J. Comput. Math. 53, No. 3-4, 135-147 (1994). MSC: 68R10 68Q25 05C35 PDFBibTeX XMLCite \textit{R. J. Cimikowski}, Int. J. Comput. Math. 53, No. 3--4, 135--147 (1994; Zbl 0842.68057) Full Text: DOI
Park, Ki-Hong; Aoe, Jun-Ichi; Morimoto, Katsushi; Shishibori, Masami An algorithm for dynamic processing of DAWG’s. (English) Zbl 0839.68027 Int. J. Comput. Math. 54, No. 3-4, 155-173 (1994). MSC: 68P20 68P05 68R10 PDFBibTeX XMLCite \textit{K.-H. Park} et al., Int. J. Comput. Math. 54, No. 3--4, 155--173 (1994; Zbl 0839.68027) Full Text: DOI
Lin, Rong; Olariu, Stephan Optimal parallel colouring algorithms for totally decomposable graphs. (English) Zbl 0813.68113 Int. J. Comput. Math. 48, No. 1-2, 1-9 (1993). MSC: 68W15 68R10 68Q25 05C15 PDFBibTeX XMLCite \textit{R. Lin} and \textit{S. Olariu}, Int. J. Comput. Math. 48, No. 1--2, 1--9 (1993; Zbl 0813.68113) Full Text: DOI
Yu, Chang-Wu; Chen, Gen-Huey Generate all maximal independent sets in permutation graphs. (English) Zbl 0824.68091 Int. J. Comput. Math. 47, No. 1-2, 1-8 (1993). MSC: 68R10 68Q25 PDFBibTeX XMLCite \textit{C.-W. Yu} and \textit{G.-H. Chen}, Int. J. Comput. Math. 47, No. 1--2, 1--8 (1993; Zbl 0824.68091) Full Text: DOI
Gupta, D. K. An enhancement scheme for constraint satisfaction problems (CSPs). (English) Zbl 0813.68151 Int. J. Comput. Math. 47, No. 3-4, 177-180 (1993). MSC: 68T20 68Q25 68R10 PDFBibTeX XMLCite \textit{D. K. Gupta}, Int. J. Comput. Math. 47, No. 3--4, 177--180 (1993; Zbl 0813.68151) Full Text: DOI
Tsouros, C.; Satratzemi, M. Tree search algorithms for the dominating vertex set problem. (English) Zbl 0813.68145 Int. J. Comput. Math. 47, No. 3-4, 127-133 (1993). MSC: 68R10 68T20 PDFBibTeX XMLCite \textit{C. Tsouros} and \textit{M. Satratzemi}, Int. J. Comput. Math. 47, No. 3--4, 127--133 (1993; Zbl 0813.68145) Full Text: DOI
He, Da-Ke The new design of the threaded binary trees. (English) Zbl 0807.68021 Int. J. Comput. Math. 49, No. 3-4, 177-186 (1993). MSC: 68P05 68Q15 68R10 PDFBibTeX XMLCite \textit{D.-K. He}, Int. J. Comput. Math. 49, No. 3--4, 177--186 (1993; Zbl 0807.68021) Full Text: DOI
Gupta, D. K. A note on the generation of binary trees. (English) Zbl 0797.68127 Int. J. Comput. Math. 48, No. 3-4, 149-152 (1993). MSC: 68R05 68R10 05C05 68P05 PDFBibTeX XMLCite \textit{D. K. Gupta}, Int. J. Comput. Math. 48, No. 3--4, 149--152 (1993; Zbl 0797.68127) Full Text: DOI
Mäkinen, Erkki On drawing regular bipartite graphs. (English) Zbl 0761.68075 Int. J. Comput. Math. 43, No. 1-2, 39-43 (1992). MSC: 68R10 PDFBibTeX XMLCite \textit{E. Mäkinen}, Int. J. Comput. Math. 43, No. 1--2, 39--43 (1992; Zbl 0761.68075) Full Text: DOI
Gupta, D. K. Generation of binary trees from (0-1) codes. (English) Zbl 0742.68024 Int. J. Comput. Math. 42, No. 3-4, 157-162 (1992). MSC: 68W10 68R05 68P05 68R10 PDFBibTeX XMLCite \textit{D. K. Gupta}, Int. J. Comput. Math. 42, No. 3--4, 157--162 (1992; Zbl 0742.68024) Full Text: DOI
Stojmenović, Ivan On random and adaptive parallel generation of combinatorial objects. (English) Zbl 0742.68046 Int. J. Comput. Math. 42, No. 3-4, 125-135 (1992). MSC: 68R05 68R10 65C10 PDFBibTeX XMLCite \textit{I. Stojmenović}, Int. J. Comput. Math. 42, No. 3--4, 125--135 (1992; Zbl 0742.68046) Full Text: DOI