default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEddie Cheng 0001
Person information
- affiliation: Oakland University, Rochester, Michigan, USA
Other persons with the same name
- Eddie Cheng 0002 — University of Hong Kong, Hong Kong, SAR, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j166]Hong Zhang, Shuming Zhou, Eddie Cheng
:
The Cyclic Diagnosability Of Hypercubes Under The PMC Model And The MM* Model. Comput. J. 67(2): 709-718 (2024)- [j165]Pingshan Li, Min Xu, Eddie Cheng:
A note on the conditional fault-tolerant strong Menger edge connectivity of regular graphs. Discret. Appl. Math. 348: 152-158 (2024) - [j164]Wen-Han Zhu, Rong-Xia Hao, Kung-Jui Pai, Eddie Cheng:
Reliability analysis of exchanged hypercubes based on the path connectivity. Discret. Appl. Math. 358: 404-416 (2024) - [j163]Eddie Cheng, Longkun Guo, Yaping Mao, Xiaoyan Zhang:
A Commentary on the Progress of Big Data in Combinatorial Optimization. Parallel Process. Lett. 34(1): 2475001:1-2475001:6 (2024) - [j162]Zhen Ji, Yaping Mao, Eddie Cheng, Xiaoyan Zhang:
Realizability problem of distance-edge-monitoring numbers. RAIRO Oper. Res. 58(5): 3715-3732 (2024) - [j161]Weixing Zheng, Shuming Zhou, Eddie Cheng, Qifan Zhang:
Non-inclusive g-extra diagnosability of interconnection networks under PMC model. Theor. Comput. Sci. 1022: 114887 (2024) - [j160]Hong Zhang, Shuming Zhou, Eddie Cheng, Sun-Yuan Hsieh:
Characterization of Cyclic Diagnosability of Regular Diagnosable Networks. IEEE Trans. Reliab. 73(1): 270-278 (2024) - 2023
- [j159]Yanze Huang, Limei Lin, Eddie Cheng, Li Xu:
Component Fault Diagnosis and Fault Tolerance of Alternating Group Graphs. Comput. J. 66(5): 1184-1194 (2023) - [j158]Hong Zhang, Shuming Zhou, Eddie Cheng:
Restricted connectivity of Cayley graph generated by transposition trees. Discret. Appl. Math. 327: 87-95 (2023) - [j157]Mohamad Abdallah, Eddie Cheng:
Conditional strong matching preclusion of the pancake graph. Int. J. Parallel Emergent Distributed Syst. 38(1): 1-13 (2023) - [j156]Xiaoqing Liu, Shuming Zhou, Eddie Cheng, Hong Zhang:
Reliability analysis of the generalized balanced hypercube. Theor. Comput. Sci. 942: 297-311 (2023) - [j155]Qifan Zhang, Shuming Zhou, Eddie Cheng:
Component connectivity of augmented cubes. Theor. Comput. Sci. 952: 113784 (2023) - [j154]Eddie Cheng, László Lipták, Ke Qiu, Zhizhang Shen, Abhishek Vangipuram:
On the g-extra connectivity of augmented cubes. Theor. Comput. Sci. 970: 114059 (2023) - [c15]Eddie Cheng, Ethan Gibbons, Ke Qiu, Zhizhang Shen:
Forward Difference Properties of the (n, k)-Star Graph and Some Other Interconnection Networks. ICPADS 2023: 138-145 - [i2]Chenxu Yang, Ping Li, Yaping Mao, Eddie Cheng, Ralf Klasing:
Constructing disjoint Steiner trees in Sierpiński graphs. CoRR abs/2310.16463 (2023) - 2022
- [j153]Jinyu Zou, Yaping Mao, Zhao Wang, Eddie Cheng:
Fractional matching preclusion number of graphs. Discret. Appl. Math. 311: 142-153 (2022) - [j152]Hong Zhang, Shuming Zhou, Eddie Cheng, Sun-Yuan Hsieh:
Characterization of component diagnosability of regular networks. Discret. Appl. Math. 322: 253-267 (2022) - [j151]Sambhav Gupta, Eddie Cheng, László Lipták:
Conditional fractional matching preclusion for burnt pancake graphs and pancake-like graphs. Int. J. Comput. Math. Comput. Syst. Theory 7(4): 207-222 (2022) - [j150]Tianlong Ma, Eddie Cheng, Yaping Mao, Xu Wang:
A note on maximum fractional matchings of graphs. J. Comb. Optim. 43(1): 253-264 (2022) - [j149]Eddie Cheng, László Lipták, Ke Qiu, Zhizhang Shen:
A Note on Linearly Many Faults of Interconnection Networks. J. Interconnect. Networks 22(1): 2142017:1-2142017:6 (2022) - [j148]Eddie Cheng, Yaping Mao, Ke Qiu, Zhizhang Shen:
A general approach to deriving diagnosability results of interconnection networks. Int. J. Parallel Emergent Distributed Syst. 37(4): 369-397 (2022) - [j147]Mohamad Abdallah, Eddie Cheng:
Fault-tolerant Hamiltonian connectivity of 2-tree-generated networks. Theor. Comput. Sci. 907: 62-81 (2022) - [j146]Eddie Cheng, Ke Qiu, Zhizhang Shen:
On the g-extra diagnosability of enhanced hypercubes. Theor. Comput. Sci. 921: 6-19 (2022) - [i1]Eddie Cheng, Yaping Mao, Ke Qiu, Zhizhang Shen:
A general approach to deriving diagnosability results of interconnection networks. CoRR abs/2205.01631 (2022) - 2021
- [j145]Guanqin Lian, Shuming Zhou, Eddie Cheng, Jiafei Liu, Gaolin Chen:
Persistence of Hybrid Diagnosability of Regular Networks Under Testing Diagnostic Model. Comput. J. 64(9): 1401-1411 (2021) - [j144]Jing Li, Xujing Li, Eddie Cheng:
Super spanning connectivity of split-star networks. Inf. Process. Lett. 166: 106037 (2021) - [j143]Nan Jia, Yaping Mao, Zhao Wang, Eddie Cheng:
Linear k-arboricity of Caylay Graphs on Abelian Groups with Given Degree. Math. Comput. Sci. 15(4): 743-755 (2021) - [j142]Jiafei Liu, Shuming Zhou, Eddie Cheng, Gaolin Chen, Min Li:
Reliability Evaluation of Bicube-Based Multiprocessor System under the g-Good-Neighbor Restriction. Parallel Process. Lett. 31(4): 2150018:1-2150018:17 (2021) - [j141]Jiafei Liu, Shuming Zhou, Eddie Cheng, Qianru Zhou, Xiaoqing Liu:
Reliability analysis of the cactus-based networks. Theor. Comput. Sci. 888: 95-107 (2021) - [c14]Sambhav Gupta, Eddie Cheng, László Lipták:
Conditional Fractional Matching Preclusion for Burnt Pancake Graphs and Pancake-Like Graphs (Extended Abstract). COCOON 2021: 425-435 - 2020
- [j140]Jie-Fu Huang, Eddie Cheng, Sun-Yuan Hsieh:
Two Algorithms for Constructing Independent Spanning Trees in (n, k)-Star Graphs. IEEE Access 8: 175932-175947 (2020) - [j139]Mei-Mei Gu, Rong-Xia Hao, Eddie Cheng:
Note on Applications of Linearly Many Faults. Comput. J. 63(9): 1406-1416 (2020) - [j138]Eddie Cheng, Lih-Hsing Hsu, Chun-Nan Hung, Meng-Chien Yang:
2-spanning cyclability problems of the some generalized Petersen graphs. Discuss. Math. Graph Theory 40(3): 713-731 (2020) - [j137]Guanqin Lian, Shuming Zhou, Eddie Cheng, Jiafei Liu, Gaolin Chen, Zhendong Gu:
Reliability and conditional diagnosability of hyper bijective connection networks. Int. J. Comput. Math. Comput. Syst. Theory 5(1): 25-47 (2020) - [j136]Eddie Cheng, Ke Qiu, Zhizhang Shen:
The g-extra diagnosability of the generalized exchanged hypercube. Int. J. Comput. Math. Comput. Syst. Theory 5(2): 112-123 (2020) - [j135]Jing Li, Chris Melekian, Shurong Zuo, Eddie Cheng:
Unpaired Many-to-Many Disjoint Path Covers on Bipartite k-Ary n-Cube Networks with Faulty Elements. Int. J. Found. Comput. Sci. 31(3): 371-383 (2020) - [j134]Tianlong Ma, Yaping Mao, Eddie Cheng, Ping Han:
A note on the strong matching preclusion problem for data center networks. Inf. Process. Lett. 164: 106007 (2020) - [j133]Eddie Cheng, Ke Qiu, Zhizhang Shen:
Preface. Int. J. Parallel Emergent Distributed Syst. 35(1): 1 (2020) - [j132]Eddie Cheng, Ke Qiu, Zhizhang Shen:
Diagnosability of interconnection networks: past, present and future. Int. J. Parallel Emergent Distributed Syst. 35(1): 2-8 (2020) - [j131]Eddie Cheng, Ke Qiu, Zhizhang Shen, Weihua Yang:
Preface. Parallel Process. Lett. 30(3): 2002001:1 (2020) - [j130]Cheng-Kuan Lin, Eddie Cheng, László Lipták:
Structure and Substructure Connectivity of Hypercube-Like Networks. Parallel Process. Lett. 30(3): 2040007:1-2040007:23 (2020) - [j129]Eddie Cheng, Ke Qiu, Zhizhang Shen, Weihua Yang:
A Brief Account on the Development and Future Research Directions of Connectivity Properties of Interconnection Networks. Parallel Process. Lett. 30(3): 2040009:1-2040009:14 (2020)
2010 – 2019
- 2019
- [j128]Xiaxia Guan, Lina Xue, Eddie Cheng, Weihua Yang:
Minimum degree and size conditions for the proper connection number of graphs. Appl. Math. Comput. 352: 205-210 (2019) - [j127]Shu-Li Zhao, Rong-Xia Hao, Eddie Cheng:
Two kinds of generalized connectivity of dual cubes. Discret. Appl. Math. 257: 306-316 (2019) - [j126]Tianlong Ma, Yaping Mao, Eddie Cheng, Jinling Wang:
Fractional matching preclusion for arrangement graphs. Discret. Appl. Math. 270: 181-189 (2019) - [j125]Tianlong Ma, Yaping Mao, Eddie Cheng, Christopher Melekian:
Fractional matching preclusion for generalized augmented cubes. Discret. Math. Theor. Comput. Sci. 21(4) (2019) - [j124]Eddie Cheng, Spencer Liu, Chris Melekian, Karimah Sweet, Chittesh Thavamani, Freddie Zhao:
Strong matching preclusion problem of the folded Petersen cube. Int. J. Comput. Math. Comput. Syst. Theory 4(1): 1-15 (2019) - [j123]Eddie Cheng, Sun-Yuan Hsieh, Delaram Kahrobaei:
Introduction. Int. J. Comput. Math. Comput. Syst. Theory 4(3-4): 127-128 (2019) - [j122]Zhao Wang, Yaping Mao, Christopher Melekian, Eddie Cheng:
Steiner Distance in Join, Corona, Cluster, and Threshold Graphs. J. Inf. Sci. Eng. 35(4): 721-735 (2019) - [j121]Eddie Cheng, Yaping Mao:
Preface. J. Interconnect. Networks 19(3): 1902002:1-1902002:1 (2019) - [j120]Yaping Mao, Eddie Cheng:
A Concise Survey of Matching Preclusion in Interconnection Networks. J. Interconnect. Networks 19(3): 1940006:1-1940006:13 (2019) - [j119]Pranav Arunandhi, Eddie Cheng, Christopher Melekian:
A Note on the Steiner k-Diameter of Tensor Product Networks. Parallel Process. Lett. 29(2): 1950008:1-1950008:7 (2019) - [j118]Ajay Arora, Eddie Cheng, Colton Magnant:
Proper Coloring Distance in Edge-Colored Cartesian Products of Complete Graphs and Cycles. Parallel Process. Lett. 29(4): 1950016:1-1950016:9 (2019) - [j117]Zhao Wang, Christopher Melekian, Eddie Cheng, Yaping Mao:
Matching preclusion number in product graphs. Theor. Comput. Sci. 755: 38-47 (2019) - [j116]Eddie Cheng, Ke Qiu, Zhizhang Shen:
A general approach to deriving the g-good-neighbor conditional diagnosability of interconnection networks. Theor. Comput. Sci. 757: 56-67 (2019) - [j115]Zhao Wang, Yaping Mao, Eddie Cheng, Jinyu Zou:
Matching preclusion number of graphs. Theor. Comput. Sci. 759: 61-71 (2019) - [j114]Christopher Melekian, Eddie Cheng:
A note on generalized matching preclusion in bipartite graphs. Theor. Comput. Sci. 791: 132-140 (2019) - [j113]Mei-Mei Gu, Shengjie He, Rong-Xia Hao, Eddie Cheng:
Strongly Menger connectedness of data center network and (n, k)-star graph. Theor. Comput. Sci. 799: 94-103 (2019) - [p1]Eddie Cheng, Rong-Xia Hao, Ke Qiu, Zhizhang Shen:
Structural Properties and Fault Resiliency of Interconnection Networks. From Parallel to Emergent Computing 2019: 77-102 - 2018
- [j112]Yaping Mao, Eddie Cheng, Zhao Wang, Zhiwei Guo:
The k-independence number of graph products. Art Discret. Appl. Math. 1(1): #P1.01 (2018) - [j111]Chun-Nan Hung, Tao-Ming Wang, Lih-Hsing Hsu, Eddie Cheng:
Fault-Hamiltonicity of Cartesian products of directed cycles. Art Discret. Appl. Math. 1(1): #P1.06 (2018) - [j110]Yaping Mao, Eddie Cheng, Zhao Wang:
Steiner Distance in Product Networks. Discret. Math. Theor. Comput. Sci. 20(2) (2018) - [j109]Karimah Sweet, Li Li, Eddie Cheng, László Lipták, Daniel E. Steffy:
A Complete Classification of Which (n, k)-Star Graphs are Cayley Graphs. Graphs Comb. 34(1): 241-260 (2018) - [j108]Yaping Mao, Christopher Melekian, Eddie Cheng:
A note on the Steiner -diameter of a graph. Int. J. Comput. Math. Comput. Syst. Theory 3(1): 41-46 (2018) - [j107]Sai Antantapantula, Christopher Melekian, Eddie Cheng:
Matching Preclusion for the Shuffle-Cubes. Parallel Process. Lett. 28(3): 1850012:1-1850012:9 (2018) - [j106]Tianlong Ma, Yaping Mao, Eddie Cheng, Jinling Wang:
Fractional Matching Preclusion for (n, k)-Star Graphs. Parallel Process. Lett. 28(4): 1850017:1-1850017:15 (2018) - [j105]Yaping Mao, Zhao Wang, Eddie Cheng, Christopher Melekian:
Strong matching preclusion number of graphs. Theor. Comput. Sci. 713: 11-20 (2018) - [j104]Shengjie He, Rong-Xia Hao, Eddie Cheng:
Strongly Menger-edge-connectedness and strongly Menger-vertex-connectedness of regular networks. Theor. Comput. Sci. 731: 50-67 (2018) - [c13]Tianlong Ma, Yaping Mao, Eddie Cheng, Christopher Melekian:
Fractional Matching Preclusion for (Burnt) Pancake Graphs. I-SPAN 2018: 133-141 - 2017
- [j103]Eddie Cheng, Colton Magnant, Dhruv Medarametla:
Proper distance in edge-colored hypercubes. Appl. Math. Comput. 313: 384-391 (2017) - [j102]Eddie Cheng, Ke Qiu, Zhizhang Shen:
A strong connectivity property of the generalized exchanged hypercube. Discret. Appl. Math. 216: 529-536 (2017) - [j101]Eddie Cheng, Li Li, László Lipták, Sangho Shim, Daniel E. Steffy:
On the Problem of Determining which (n, k)-Star Graphs are Cayley Graphs. Graphs Comb. 33(1): 85-102 (2017) - [j100]Eddie Cheng, Ke Qiu, Zhizhang Shen:
Diagnosability problems of the exchanged hypercube and its generalization. Int. J. Comput. Math. Comput. Syst. Theory 2(2): 39-52 (2017) - [j99]Eddie Cheng, Ke Qiu, Zhizhang Shen:
On Diagnosability of Interconnection Networks. Int. J. Unconv. Comput. 13(3): 245-251 (2017) - [j98]Chun-Nan Hung, Cheng-Kuan Lin, Lih-Hsing Hsu, Eddie Cheng, László Lipták:
Strong Fault-Hamiltonicity for the Crossed Cube and Its Extensions. Parallel Process. Lett. 27(2): 1750005:1-1750005:25 (2017) - [j97]Eddie Cheng, Ke Qiu, Zhizhang Shen:
On the restricted connectivity of the arrangement graph. J. Supercomput. 73(8): 3669-3682 (2017) - [c12]Eddie Cheng, Ke Qiu, Zhizhang Shen:
A Study of the Decycling Problem for the Generalized Exchanged Hypercube. ISPAN-FCST-ISCC 2017: 93-99 - [c11]Zhao Wang, Yaping Mao, Christopher Melekian, Eddie Cheng:
Steiner Distance in Join, Corona and Threshold Graphs. ISPAN-FCST-ISCC 2017: 100-104 - 2016
- [j96]Eddie Cheng, Ke Qiu, Zhizhang Shen:
Length two path centered surface areas of the (n, k)-star graph. Inf. Sci. 332: 115-130 (2016) - [j95]Eddie Cheng, Omer Siddiqui:
Strong Matching Preclusion of Arrangement Graphs. J. Interconnect. Networks 16(2): 1650004:1-1650004:14 (2016) - [j94]Eddie Cheng, Justin Kelm, Roi Orzach, Brian Xu:
Strong matching preclusion of burnt pancake graphs. Int. J. Parallel Emergent Distributed Syst. 31(3): 220-232 (2016) - [j93]Eddie Cheng, Ke Qiu, Zhizhang Shen:
On the Conditional Diagnosability of Hyper-Buttery Graphs snd Related Networks. Parallel Process. Lett. 26(1): 1650005:1-1650005:18 (2016) - [j92]Eddie Cheng, Justin Kelm, Joseph Renzi:
Strong matching preclusion of (n, k)-star graphs. Theor. Comput. Sci. 615: 91-101 (2016) - 2015
- [j91]Eddie Cheng, László Lipták, Lih-Hsing Hsu, Jimmy J. M. Tan, Cheng-Kuan Lin:
Conditional Matching Preclusion For The Star Graphs. Ars Comb. 120: 369-382 (2015) - [j90]Chun-Nan Hung, Eddie Cheng, Tao-Ming Wang, Lih-Hsing Hsu:
On Hamiltonian properties of unidirectional hypercubes. Inf. Process. Lett. 115(6-8): 551-555 (2015) - [j89]Eddie Cheng, Ke Qiu, Zhizhang Shen:
Connectivity Results of Complete Cubic Networks as Associated with Linearly Many Faults. J. Interconnect. Networks 15(1-2): 1550007:1-1550007:23 (2015) - [j88]Dhruv Medarametla, Eddie Cheng, Steven Cheng, Lawrance Wu:
Linearly Many Edge-Faults in 2-Bijective Connection Networks. Parallel Process. Lett. 25(4): 1550006:1-1550006:8 (2015) - [j87]Eddie Cheng, Robert Connolly, Christopher Melekian:
Matching preclusion and conditional matching preclusion problems for the folded Petersen cube. Theor. Comput. Sci. 576: 30-44 (2015) - [j86]Nai-Wen Chang, Eddie Cheng, Sun-Yuan Hsieh:
Conditional Diagnosability of Cayley Graphs Generated by Transposition Trees under the PMC Model. ACM Trans. Design Autom. Electr. Syst. 20(2): 20:1-20:16 (2015) - 2014
- [j85]Cheng-Kuan Lin, Jimmy J. M. Tan, Lih-Hsing Hsu, Eddie Cheng, László Lipták:
Conditional Fault Hamiltonicity of the Star Graph. Ars Comb. 113: 111-127 (2014) - [j84]Eddie Cheng, Ke Qiu, Zhizhang Shen:
On the Surface Areas of the Alternating Group Graph and the Split-Star Graph. Ars Comb. 115: 239-260 (2014) - [j83]Eddie Cheng, Ke Qiu, Zhizhang Shen:
The number of shortest paths in the (n, k)-star graph. Discret. Math. Algorithms Appl. 6(4) (2014) - [j82]Eddie Cheng, Ke Qiu, Zhizhang Shen:
Length two path-centred surface areas for the arrangement graph. Int. J. Comput. Math. 91(6): 1170-1189 (2014) - [j81]Eddie Cheng, Ke Qiu, Zhizhang Shen:
The edge-centered surface area of the arrangement graph. J. Comb. Optim. 27(1): 49-64 (2014) - [j80]Eddie Cheng, Philip Hu, Roger Jia, László Lipták, Brian Scholten, James R. Voss:
Matching preclusion and conditional matching preclusion for pancake and burnt pancake graphs. Int. J. Parallel Emergent Distributed Syst. 29(5): 499-512 (2014) - [j79]Eddie Cheng, Ke Qiu, Zhizhang Shen:
On the conditional diagnosability of matching composition networks. Theor. Comput. Sci. 557: 101-114 (2014) - [j78]Eddie Cheng, Ke Qiu, Zhizhang Shen:
Deriving length two path centered surface area for the arrangement graph: a generating function approach. J. Supercomput. 68(3): 1241-1264 (2014) - [c10]Eddie Cheng, Ke Qiu, Zhizhang Shen:
Connectivity Results of Hierarchical Cubic Networks as Associated with Linearly Many Faults. CSE 2014: 1213-1220 - 2013
- [j77]Eddie Cheng, Ke Qiu, Zhizhang Shen:
A Generating Function Approach to the Edge Surface Area of the Arrangement Graphs. Comput. J. 56(7): 871-881 (2013) - [j76]Eddie Cheng, László Lipták, Ke Qiu, Zhizhang Shen:
Cyclic Vertex-Connectivity of Cayley Graphs Generated by Transposition Trees. Graphs Comb. 29(4): 835-841 (2013) - [j75]Eddie Cheng, Ke Qiu, Zhizhang Shen:
A Faster Algorithm for Finding Disjoint Ordering of Sets. Int. J. Netw. Comput. 3(2): 182-191 (2013) - [j74]Eddie Cheng, László Lipták, Daniel E. Steffy:
Strong local diagnosability of (n, k)(n, k)-star graphs and Cayley graphs generated by 2-trees with missing edges. Inf. Process. Lett. 113(12): 452-456 (2013) - [j73]Eddie Cheng, László Lipták:
Diagnosability of Cayley graphs generated by transposition trees with missing edges. Inf. Sci. 238: 250-252 (2013) - [j72]Eddie Cheng, Jerrold W. Grossman, Ke Qiu, Zhizhang Shen:
The number of shortest paths in the arrangement graph. Inf. Sci. 240: 191-204 (2013) - [j71]Eddie Cheng, David Lu, Brian Xu:
Strong Matching preclusion of Pancake graphs. J. Interconnect. Networks 14(2) (2013) - [j70]Chun-Nan Hung, David Lu, Randy Jia, Cheng-Kuan Lin, László Lipták, Eddie Cheng, Jimmy J. M. Tan, Lih-Hsing Hsu:
4-ordered-Hamiltonian problems of the generalized Petersen graph GP(n, 4). Math. Comput. Model. 57(3-4): 595-601 (2013) - [j69]Eddie Cheng, László Lipták, Allen Yuan:
Linearly many faults in arrangement graphs. Networks 61(4): 281-289 (2013) - [j68]Ariana Angjeli, Eddie Cheng, László Lipták:
Linearly many faults in augmented cubes. Int. J. Parallel Emergent Distributed Syst. 28(5): 475-483 (2013) - [j67]Eddie Cheng, László Lipták:
Conditional Matching preclusion for (n, k)-Star Graphs. Parallel Process. Lett. 23(1) (2013) - [j66]Eddie Cheng, Nart Shawash:
The QN, k, M Graph: a Common Generalization of Various Popular Interconnection Networks. Parallel Process. Lett. 23(3) (2013) - [j65]Ariana Angjeli, Eddie Cheng, László Lipták:
Linearly many faults in dual-cube-like networks. Theor. Comput. Sci. 472: 1-8 (2013) - [j64]Eddie Cheng, Shalin Shah, Vyom Shah, Daniel E. Steffy:
Strong matching preclusion for augmented cubes. Theor. Comput. Sci. 491: 71-77 (2013) - 2012
- [j63]Eddie Cheng, László Lipták:
Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products. Discret. Appl. Math. 160(12): 1699-1716 (2012) - [j62]Eddie Cheng, Marc J. Lipman, László Lipták:
Matching preclusion and conditional matching preclusion for regular interconnection networks. Discret. Appl. Math. 160(13-14): 1936-1954 (2012) - [j61]László Lipták, Eddie Cheng, Jong-Seok Kim, Sung Won Kim:
One-to-many node-disjoint paths of hyper-star networks. Discret. Appl. Math. 160(13-14): 2006-2014 (2012) - [j60]Lih-Hsing Hsu, Jimmy J. M. Tan, Eddie Cheng, László Lipták, Cheng-Kuan Lin, Ming Tsai:
Solution to an open problem on 4-ordered Hamiltonian graphs. Discret. Math. 312(15): 2356-2370 (2012) - [j59]Lih-Hsing Hsu, Eddie Cheng, László Lipták, Jimmy J. M. Tan, Cheng-Kuan Lin, Tung-Yang Ho:
Component connectivity of the hypercubes. Int. J. Comput. Math. 89(2): 137-145 (2012) - [j58]Eddie Cheng, László Lipták, Ke Qiu, Zhizhang Shen:
On deriving conditional diagnosability of interconnection networks. Inf. Process. Lett. 112(17-18): 674-677 (2012) - [j57]Eddie Cheng, László Lipták, Ke Qiu, Zhizhang Shen:
A Unified Approach to the Conditional Diagnosability of Interconnection Networks. J. Interconnect. Networks 13(3-4) (2012) - [j56]Eddie Cheng, Philip Hu, Roger Jia, László Lipták:
Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions. Networks 59(4): 349-356 (2012) - [j55]Eddie Cheng, Philip Hu, Roger Jia, László Lipták:
Matching preclusion and conditional matching preclusion for bipartite interconnection networks II: Cayley graphs generated by transposition trees and hyper-stars. Networks 59(4): 357-364 (2012) - [j54]Eddie Cheng, Sachin Padmanabhan:
Matching preclusion and Conditional Matching preclusion for Crossed Cubes. Parallel Process. Lett. 22(2) (2012) - [j53]Eddie Cheng, Ke Qiu, Zhizhang Shen:
A note on the alternating group network. J. Supercomput. 59(1): 246-248 (2012) - [j52]Jong-Seok Kim, Sung Won Kim, Eddie Cheng, László Lipták:
Topological properties of folded hyper-star networks. J. Supercomput. 59(3): 1336-1347 (2012) - [j51]Eddie Cheng, Ke Qiu, Zhizhang Shen:
On the surface area of the augmented cubes. J. Supercomput. 61(3): 856-868 (2012) - [c9]Eddie Cheng, Ke Qiu, Zhizhang Shen:
The Edge-Centered Surface Area of the Arrangement Graph. COCOA 2012: 49-60 - [c8]Eddie Cheng, Ke Qiu, Zhizhang Shen:
A Faster Algorithm for Finding Disjoint Ordering of Sets. ICNC 2012: 118-124 - 2011
- [j50]Weihua Yang, Zhao Zhang, Xiaofeng Guo, Eddie Cheng, László Lipták:
On the edge-connectivity of graphs with two orbits of the same size. Discret. Math. 311(16): 1768-1777 (2011) - [j49]Jong-Seok Kim, Eddie Cheng, László Lipták, Hyeong-Ok Lee:
A note on embeddings among folded hypercubes, even graphs and odd graphs. Int. J. Comput. Math. 88(5): 882-891 (2011) - [j48]Eddie Cheng, László Lipták, Marc J. Lipman, Matthew Toeniskoetter:
Conditional matching preclusion for the alternating group graphs and split-stars. Int. J. Comput. Math. 88(6): 1120-1136 (2011) - [j47]Allen Yuan, Eddie Cheng, László Lipták:
Linearly Many Faults in (n, k)-Star Graphs. Int. J. Found. Comput. Sci. 22(7): 1729-1745 (2011) - [j46]Jong-Seok Kim, Hyeong-Ok Lee, Eddie Cheng, László Lipták:
Independent spanning trees on even networks. Inf. Sci. 181(13): 2892-2905 (2011) - [j45]Eddie Cheng, László Lipták, Weihua Yang, Zhao Zhang, Xiaofeng Guo:
A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees. Inf. Sci. 181(19): 4300-4308 (2011) - [j44]Philip Bonneville, Eddie Cheng, Joseph Renzi:
Strong Matching preclusion for the Alternating Group Graphs and Split-Stars. J. Interconnect. Networks 12(4): 277-298 (2011) - [j43]Eddie Cheng, Ke Qiu, Zhizhang Shen:
On the Surface Areas and Average Distances of Meshes and Tori. Parallel Process. Lett. 21(1): 61-75 (2011) - [j42]Eddie Cheng, Marc J. Lipman, László Lipták, David Sherman:
Conditional matching preclusion for the arrangement graphs. Theor. Comput. Sci. 412(45): 6279-6289 (2011) - [j41]Jong-Seok Kim, Hyeong-Ok Lee, Eddie Cheng, László Lipták:
Optimal Independent Spanning Trees on Odd Graphs. J. Supercomput. 56(2): 212-225 (2011) - [c7]Eddie Cheng, Ke Qiu, Zhizhang Shen:
On the Surface Area of the Asymmetric Twisted Cube. COCOA 2011: 411-423 - [c6]Christopher E. Gillies, Nilesh V. Patel, Gautam B. Singh, Serge G. Kruk, Eddie Cheng, George D. Wilson:
Minimum Steiner Tree for Automatic SQL Query Generation Applied on a Medical Record Database. SERVICES 2011: 443-450 - 2010
- [j40]Eddie Cheng, László Lipták, David Sherman:
Matching preclusion for the (n, k)-bubble-sort graphs. Int. J. Comput. Math. 87(11): 2408-2418 (2010) - [j39]Eddie Cheng, Ke Qiu, Zhizhang Shen:
On deriving explicit formulas of the surface areas for the arrangement graphs and some of the related graphs. Int. J. Comput. Math. 87(13): 2903-2914 (2010) - [j38]Eddie Cheng, Jerrold W. Grossman, László Lipták, Ke Qiu, Zhizhang Shen:
Distance formula and shortest paths for the (n, k)-star graphs. Inf. Sci. 180(9): 1671-1680 (2010) - [j37]Eddie Cheng, Randy Jia, David Lu:
Matching preclusion and Conditional Matching preclusion for Augmented Cubes. J. Interconnect. Networks 11(1-2): 35-60 (2010) - [j36]Cheng-Kuan Lin, Jimmy J. M. Tan, Lih-Hsing Hsu, Eddie Cheng, László Lipták:
On the Existence of Disjoint Spanning Paths in Faulty Hypercubes. J. Interconnect. Networks 11(1-2): 71-96 (2010) - [j35]David Sherman, Ming Tsai, Cheng-Kuan Lin, László Lipták, Eddie Cheng, Jimmy J. M. Tan, Lih-Hsing Hsu:
4-Ordered Hamiltonicity for Some Chordal Ring Graphs. J. Interconnect. Networks 11(3-4): 157-174 (2010) - [j34]Eddie Cheng, László Lipták, Fred Sala:
Linearly many faults in 2-tree-generated networks. Networks 55(2): 90-98 (2010) - [c5]Eddie Cheng, Ke Qiu, Zhizhang Shen:
The Number of Shortest Paths in the (n, k)-Star Graphs. COCOA (1) 2010: 222-236
2000 – 2009
- 2009
- [j33]Jong-Seok Kim, Eddie Cheng, László Lipták, Hyeong-Ok Lee:
Embedding hypercubes, rings, and odd graphs into hyper-stars. Int. J. Comput. Math. 86(5): 771-778 (2009) - [j32]Eddie Cheng, Linda M. Lesniak, Marc J. Lipman, László Lipták:
Conditional matching preclusion sets. Inf. Sci. 179(8): 1092-1101 (2009) - [j31]Eddie Cheng, Ke Qiu, Zhizhang Shen:
A Generating Function Approach to the Surface Areas of Some Interconnection Networks. J. Interconnect. Networks 10(3): 189-204 (2009) - [j30]Eddie Cheng, Ke Qiu, Zhizhang Shen:
A short note on the surface area of star graphs. Parallel Process. Lett. 19(1): 19-22 (2009) - [j29]Zhizhang Shen, Ke Qiu, Eddie Cheng:
On the surface area of the (n, k)-star graph. Theor. Comput. Sci. 410(52): 5481-5490 (2009) - [c4]Eddie Cheng, Shuhong Gao, Ke Qiu, Zhizhang Shen:
On Disjoint Shortest Paths Routing on the Hypercube. COCOA 2009: 375-383 - 2008
- [j28]Eddie Cheng, László Lipták, Nart Shawash:
Orienting Cayley graphs generated by transposition trees. Comput. Math. Appl. 55(11): 2662-2672 (2008) - [j27]Eddie Cheng, Marc J. Lipman, László Lipták:
Strong structural properties of unidirectional star graphs. Discret. Appl. Math. 156(15): 2939-2949 (2008) - [j26]Eddie Cheng, Linda M. Lesniak, Marc J. Lipman, László Lipták:
Matching preclusion for Alternating Group Graphs and their Generalizations. Int. J. Found. Comput. Sci. 19(6): 1413-1437 (2008) - [j25]Cheng-Kuan Lin, Jimmy J. M. Tan, Lih-Hsing Hsu, Eddie Cheng, László Lipták:
Conditional Diagnosability of Cayley Graphs Generated by Transposition Trees under the Comparison Diagnosis Model. J. Interconnect. Networks 9(1/2): 83-97 (2008) - [j24]Eddie Cheng, Marc J. Lipman, László Lipták, David Stiebel:
Hamiltonian connectivity of 2-tree-generated networks. Math. Comput. Model. 48(5-6): 787-804 (2008) - [c3]Zhizhang Shen, Ke Qiu, Eddie Cheng:
On the Surface Area of the (n, k)-Star Graph. COCOA 2008: 393-404 - 2007
- [j23]Eddie Cheng, László Lipták:
Fault Resiliency of Cayley Graphs Generated by Transpositions. Int. J. Found. Comput. Sci. 18(5): 1005-1022 (2007) - [j22]Eddie Cheng, László Lipták:
Linearly many faults in Cayley graphs generated by transposition trees. Inf. Sci. 177(22): 4877-4882 (2007) - [j21]Eddie Cheng, László Lipták:
Matching preclusion for some interconnection networks. Networks 50(2): 173-180 (2007) - 2006
- [j20]Eddie Cheng, László Lipták:
Structural Properties Of Hyper-Stars. Ars Comb. 80 (2006) - 2005
- [j19]Eddie Cheng, William A. Lindsey, Daniel E. Steffy:
Maximal vertex-connectivity of. Networks 46(3): 154-162 (2005) - 2004
- [j18]Eddie Cheng, Sven de Vries:
Separating multi-oddity constrained shortest circuits over the polytope of stable multisets. Oper. Res. Lett. 32(2): 181-184 (2004) - 2003
- [j17]Eddie Cheng, Jerrold W. Grossman, Marc J. Lipman:
Time-stamped Graphs and Their Associated Influence Digraphs. Discret. Appl. Math. 128(2-3): 317-335 (2003) - 2002
- [j16]Eddie Cheng, Marc J. Lipman:
Vulnerability issues of star graphs, alternating group graphs and split-stars: strength and toughness. Discret. Appl. Math. 118(3): 163-179 (2002) - [j15]Eddie Cheng, Jerrold W. Grossman, Marc J. Lipman:
Influence Digraphs Induced by Time-Stamped Graphs (Extended Abstract). Electron. Notes Discret. Math. 11: 128-139 (2002) - [j14]Eddie Cheng, Marc J. Lipman:
Basic Structures of Some Interconnection Networks. Electron. Notes Discret. Math. 11: 140-156 (2002) - [j13]Eddie Cheng, Sven de Vries:
Separation of Antiweb-Wheel Inequalities Over Stable Set Polytopes. Electron. Notes Discret. Math. 11: 157-171 (2002) - [j12]Eddie Cheng, Marc J. Lipman:
Unidirectional (n, k)-Star Graphs. J. Interconnect. Networks 3(1-2): 19-34 (2002) - [j11]Eddie Cheng, Sven de Vries:
Antiweb-wheel inequalities and their separation problems over the stable set polytopes. Math. Program. 92(1): 153-175 (2002) - [j10]Eddie Cheng, Marc J. Lipman:
Increasing the connectivity of the star graphs. Networks 40(3): 165-169 (2002) - [j9]Eddie Cheng, Sven de Vries:
On the Facet-Inducing Antiweb-Wheel Inequalities for Stable Set Polytopes. SIAM J. Discret. Math. 15(4): 470-487 (2002) - [c2]Eddie Cheng, Serge G. Kruk, Marc J. Lipman:
Flow Formulations for the Student Scheduling Problem. PATAT 2002: 299-309 - 2001
- [j8]Eddie Cheng, Marc J. Lipman, Hyungju Park:
Super Connectivity of Star Graphs, Alternating Group Graphs and Split-Stars. Ars Comb. 59 (2001) - 2000
- [j7]Eddie Cheng, Marc J. Lipman:
On the Day-Tripathi orientation of the star graphs: Connectivity. Inf. Process. Lett. 73(1-2): 5-10 (2000) - [j6]Eddie Cheng, Marc J. Lipman:
Orienting split-stars and alternating group graphs. Networks 35(2): 139-144 (2000)
1990 – 1999
- 1999
- [j5]Eddie Cheng:
Edge-augmentation of hypergraphs. Math. Program. 84(3): 443-465 (1999) - [j4]Eddie Cheng, Tibor Jordán:
Successive edge-connectivity augmentation problems. Math. Program. 84(3): 577-593 (1999) - 1998
- [j3]Eddie Cheng:
Separating subdivision of bicycle wheel inequalities over cut polytopes. Oper. Res. Lett. 23(1-2): 13-19 (1998) - 1997
- [j2]Eddie Cheng, William H. Cunningham:
Wheel inequalitites for stable set polytopes. Math. Program. 77: 389-421 (1997) - 1995
- [c1]Eddie Cheng, William H. Cunningham:
Separation Problems for the Stable Set Polytope. IPCO 1995: 65-79 - 1994
- [j1]Eddie Cheng, William H. Cunningham:
A Faster Algorithm for Computing the Strength of a Network. Inf. Process. Lett. 49(4): 209-212 (1994)
Coauthor Index
[j154] [j151] [j149] [c14] [j130] [j109] [j101] [j98] [j91] [j85] [j80] [j76] [j74] [j73] [j70] [j69] [j68] [j67] [j65] [j63] [j62] [j61] [j60] [j59] [j58] [j57] [j56] [j55] [j52] [j50] [j49] [j48] [j47] [j46] [j45] [j42] [j41] [j40] [j38] [j36] [j35] [j34] [j33] [j32] [j28] [j27] [j26] [j25] [j24] [j23] [j22] [j21] [j20]
Christopher Melekian
aka: Chris Melekian
aka: Chris Melekian
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-17 21:54 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
