Search results for "wide-diameter"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
84	Hui-Ling Huang, Gen-Huey Chen	Combinatorial Properties of Two-Level Hypernet Networks.	IEEE Trans. Parallel Distributed Syst.	1999	DBLP DOI BibTeX RDF	Best container, hypernet network, container, graph-theoretic interconnection network, wide diameter, fault diameter
69	Dyi-Rong Duh, Gen-Huey Chen, Jywe-Fei Fang	Algorithms and Properties of a New Two-Level Network with Folded Hypercubes as Basic Modules.	IEEE Trans. Parallel Distributed Syst.	1995	DBLP DOI BibTeX RDF	?-wide diameter, node-fault diameter, interconnection network, connectivity, embedding, routing algorithm, diameter, container, Broadcasting algorithm, Hamiltonian circuit
68	Hsun-Wen Chang, San-Yu Chen	The 3-Wide-Diameter of the Hyper-L Triple-Loop Network.	PDCAT	2006	DBLP DOI BibTeX RDF
64	H. E. Escuardro, Felix P. Muga II	Wide-diameter of generalized undirected de Bruijn graph UGB(n, n2).	ISPAN	1997	DBLP DOI BibTeX RDF	undirected, graph theory, digraph, de Bruijn graph, wide-diameter
62	Jun-Ming Xu 0001	Wide Diameters of Cartesian Product Graphs and Digraphs.	J. Comb. Optim.	2004	DBLP DOI BibTeX RDF	fault tolerance, networks, connectivity, diameter, cartesian product, wide diameter
51	Xingde Jia	Wide Diameter of Cayley Digraphs of Finite Cyclic Groups.	ISPAN	2008	DBLP DOI BibTeX RDF	Cayley digraphs, communication networks, wide diameter, geometric representation
43	Hsien-Jone Hsieh, Dyi-Rong Duh	Constructing Node-Disjoint Paths in Enhanced Pyramid Networks.	Asia-Pacific Computer Systems Architecture Conference	2006	DBLP DOI BibTeX RDF	Enhanced pyramid networks, pyramid networks, fault-tolerance, interconnection networks, container, node-disjoint paths, wide diameter
42	Jaime D. L. Caro, Luz R. Nochefranca, Polly W. Sy, Felix P. Muga II	The wide-diameter of the generalized de Bruijn graphs UGB(n, n(n+1)).	ISPAN	1996	DBLP DOI BibTeX RDF	generalized de Bruijn graphs, graph theory, de Bruijn graphs, wide-diameter
41	Jyhmin Kuo, Hung-Lin Fu	Wide diameters of de Bruijn graphs.	J. Comb. Optim.	2007	DBLP DOI BibTeX RDF	Internally disjoint path, Wide diameter, de Bruijn
39	Chien-Ping Chang, Ting-Yi Sung, Lih-Hsing Hsu	Edge Congestion and Topological Properties of Crossed Cubes.	IEEE Trans. Parallel Distributed Syst.	2000	DBLP DOI BibTeX RDF	edge congestion, hypercubes, embedding, shortest path routing, wide diameter, fault diameter, Crossed cubes, bisection width
37	Wenguo Wei, Ling Zhang, Shoubin Dong, Bolian Liu	On Two Problems of w-Wide Distance and (w-1)-Fault Distance, w-Wide Diameter ad (w-1)-Fault Diameter.	MSV/AMCS	2004	DBLP BibTeX RDF
30	Hao Qi 0001, Xuding Zhu	The fault-diameter and wide-diameter of twisted hypercubes.	Discret. Appl. Math.	2018	DBLP DOI BibTeX RDF
30	Jian-Hua Yin, Jiong-Sheng Li, Guo-Liang Chen 0001, Cheng Zhong	On the fault-tolerant diameter and wide diameter of omega-connected graphs.	Networks	2005	DBLP DOI BibTeX RDF
30	Wei-Mei Chen, Gen-Huey Chen, D. Frank Hsu	Generalized Diameters of the Mesh of Trees.	Theory Comput. Syst.	2004	DBLP DOI BibTeX RDF
30	Wei-Mei Chen, Gen-Huey Chen, D. Frank Hsu	Combinatorial Properties of Mesh of Trees.	ISPAN	2000	DBLP DOI BibTeX RDF
23	Weidong Chen 0009, Wenjun Xiao, Behrooz Parhami	Swapped (OTIS) Networks Built of Connected Basis Networks Are Maximally Fault Tolerant.	IEEE Trans. Parallel Distributed Syst.	2009	DBLP DOI BibTeX RDF
23	Jianxi Fan, Xiaola Lin, Xiaohua Jia	Optimal Path Embedding in Crossed Cubes.	IEEE Trans. Parallel Distributed Syst.	2005	DBLP DOI BibTeX RDF	optimal embedding, interconnection network, graph embedding, Crossed cube, parallel computing system
23	Jianxi Fan	Diagnosability of Crossed Cubes under the Comparison Diagnosis Model.	IEEE Trans. Parallel Distributed Syst.	2002	DBLP DOI BibTeX RDF	comparison diagnosis model, hypercube, diagnosis, multiprocessor system, Diagnosability, crossed cube
23	Jianxi Fan	Diagnosability of Crossed Cubes under the Comparison Diagnosis Model.	IEEE Trans. Parallel Distributed Syst.	2002	DBLP DOI BibTeX RDF	comparison diagnosis model, hypercube, diagnosis, multiprocessor system, Diagnosability, crossed cube
19	Hao Qi 0001, Xuding Zhu	The wide-diameter of Zn, k.	Discret. Appl. Math.	2017	DBLP DOI BibTeX RDF
19	Rija Erves, Janez Zerovnik	Wide-diameter of Product Graphs.	Fundam. Informaticae	2013	DBLP DOI BibTeX RDF
19	Yebin Chen, Ying Li, Jiankun Wang 0005	On the wide diameter of directed double-loop networks.	J. Netw. Comput. Appl.	2011	DBLP DOI BibTeX RDF
19	Iztok Banic, Janez Zerovnik	Wide diameter of Cartesian graph bundles.	Discret. Math.	2010	DBLP DOI BibTeX RDF
19	Kevin E. Jia, Alicia Q. Zhang	On Wide Diameter of Cayley Graphs.	J. Interconnect. Networks	2009	DBLP DOI BibTeX RDF
19	Cheng-Kuan Lin, Hua-Min Huang, D. Frank Hsu, Lih-Hsing Hsu	On the spanning w-wide diameter of the star graph.	Networks	2006	DBLP DOI BibTeX RDF
19	Jun-Ming Xu 0001, Zhi-Guo Deng	Wide Diameter of Möbius Cubes.	J. Interconnect. Networks	2005	DBLP DOI BibTeX RDF
19	Toru Kojima	Wide diameter and minimum length of disjoint Menger path systems.	Networks	2005	DBLP DOI BibTeX RDF
19	Toru Kojima, Kiyoshi Ando	Minimum length of cycles through specified vertices in graphs with wide-diameter at most d.	Ars Comb.	2001	DBLP BibTeX RDF
19	Toru Kojima, Kiyoshi Ando	Wide-diameter and minimum length of fan.	Theor. Comput. Sci.	2000	DBLP DOI BibTeX RDF
19	William Y. C. Chen, Vance Faber, Emanuel Knill	Restricted routing and wide diameter of the cycle prefix network.	Interconnection Networks and Mapping and Scheduling Parallel Computations	1994	DBLP DOI BibTeX RDF