Search results for "diameter"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
23	Tao Zhang 0030, Gennian Ge	On linear diameter perfect Lee codes with diameter 6.	CoRR	2022	DBLP DOI BibTeX RDF
23	Hao Qi 0001, Xuding Zhu	The fault-diameter and wide-diameter of twisted hypercubes.	Discret. Appl. Math.	2018	DBLP DOI BibTeX RDF
23	Lei You 0003, Shouzheng Tang, Xinyu Song 0001, Yuancai Lei, Hao Zang, Minghua Lou, Chongyang Zhuang	Precise Measurement of Stem Diameter by Simulating the Path of Diameter Tape from Terrestrial Laser Scanning Data.	Remote. Sens.	2016	DBLP DOI BibTeX RDF
23	Ali Mashreghi, Alireza Zarei	When Diameter Matters: Parameterized Approximation Algorithms for Bounded Diameter Minimum Steiner Tree Problem.	Theory Comput. Syst.	2016	DBLP DOI BibTeX RDF
23	Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal	Parallel Graph Decomposition and Diameter Approximation in o(Diameter) Time and Linear Space.	CoRR	2014	DBLP BibTeX RDF
23	Eduardo A. Canale, Pablo Romero	Diameter Constrained Reliability: Computational Complexity in terms of the diameter and number of terminals.	CoRR	2014	DBLP BibTeX RDF
23	Micha A. Perles, Horst Martini, Yaakov S. Kupitz	On the polygonal diameter (= link diameter) of the interior, resp. exterior, of a simple closed polygon in the plane.	Discret. Appl. Math.	2013	DBLP DOI BibTeX RDF
23	Violeta Cakulev, Avi Lior, Semyon Mizikovsky	Diameter IKEv2 SK: Using Shared Keys to Support Interaction between IKEv2 Servers and Diameter Servers.	RFC	2012	DBLP DOI BibTeX RDF
23	Ding Liu, Junli Liang	A Bayesian Approach to Diameter Estimation in the Diameter Control System of Silicon Single Crystal Growth.	IEEE Trans. Instrum. Meas.	2011	DBLP DOI BibTeX RDF
23	Nili Guttmann-Beck, Refael Hassin	Minimum diameter and cycle-diameter orientations on planar graphs	CoRR	2011	DBLP BibTeX RDF
23	Jouni Korhonen, Julien Bournelle, Kuntal Chowdhury, Ahmad Muhanna, Ulrike Meyer	Diameter Proxy Mobile IPv6: Mobile Access Gateway and Local Mobility Anchor Interaction with Diameter Server.	RFC	2010	DBLP DOI BibTeX RDF
23	Jouni Korhonen, Hannes Tschofenig, Julien Bournelle, Gerardo Giaretta, Madjid Nakhjiri	Diameter Mobile IPv6: Support for Home Agent to Diameter Server Interaction.	RFC	2010	DBLP DOI BibTeX RDF
23	Peter K. Kwok, Qi Liu 0022, Douglas B. West	Oriented diameter of graphs with diameter 3.	J. Comb. Theory, Ser. B	2010	DBLP DOI BibTeX RDF
23	Qiong-Fang Bian, Ting-Ting Hang, Hui Liu, Mu-yun Fang	Research on the Diameter and Average Diameter of Undirected Double-loop Networks.	GCC	2010	DBLP DOI BibTeX RDF
23	Jouni Korhonen, Julien Bournelle, Hannes Tschofenig, Charles E. Perkins, Kuntal Chowdhury	Diameter Mobile IPv6: Support for Network Access Server to Diameter Server Interaction.	RFC	2009	DBLP DOI BibTeX RDF
23	Juan A. Rodríguez-Velázáuez	The (alpha, beta, s, t)-diameter of graphs: A particular case of conditional diameter.	Discret. Appl. Math.	2006	DBLP DOI BibTeX RDF
23	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
23	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
23	Ayman M. Abdalla, Narsingh Deo	Random-tree Diameter and the Diameter-constrained MST.	Int. J. Comput. Math.	2002	DBLP DOI BibTeX RDF
23	David A. Grable	The Diameter of a Random Graph with Bounded Diameter.	Random Struct. Algorithms	1995	DBLP DOI BibTeX RDF
23	Chung-Lun Li, S. Thomas McCormick, David Simchi-Levi	On the minimum-cardinality-bounded-diameter and the bounded-cardinality-minimum-diameter edge addition problems.	Oper. Res. Lett.	1992	DBLP DOI BibTeX RDF
23	Chengde Xu	A necessary and sufficient condition for a graph G with diameter 5 to be 2-diameter-stable.	Discret. Math.	1991	DBLP DOI BibTeX RDF
21	Antoine Deza, Tamás Terlaky, Yuriy Zinchenko	A Continuous d -Step Conjecture for Polytopes.	Discret. Comput. Geom.	2009	DBLP DOI BibTeX RDF	Hirsch conjecture, d-Step conjecture, Diameter, Curvature, Polytopes, Central path
21	Micha A. Perles, Horst Martini, Yaakov S. Kupitz	A Jordan-Brouwer Separation Theorem for Polyhedral Pseudomanifolds.	Discret. Comput. Geom.	2009	DBLP DOI BibTeX RDF	Bing’s house, Euler’s formula, Jordan-Brouwer theorem, Jordan’s curve theorem, Jordan exterior (interior), Polygonal diameter, Polyhedral manifold, Triangulation, Dual graph
21	Zhengbin Dong, Guo-Jie Song, Kun-Qing Xie, Jingyao Wang	An experimental study of large-scale mobile social network.	WWW	2009	DBLP DOI BibTeX RDF	shortest path, diameter, degree distribution, clustering coefficient, betweenness centrality
21	Ken-ichi Fukui, Kazuhisa Sato, Junichiro Mizusaki, Kazumi Saito, Masahiro Kimura, Masayuki Numao	Growth Analysis of Neighbor Network for Evaluation of Damage Progress.	PAKDD	2009	DBLP DOI BibTeX RDF	effective diameter, complex network, temporal analysis, degree, cluster coefficient
21	Jian Wang 0003, Jian Gu, Fang Mei, Zhe Zhang, Yanheng Liu	One New BRAS Model Based on Trusted Network.	ISECS	2008	DBLP DOI BibTeX RDF	BRAS, TNC, PANA, Diameter
21	Elías F. Combarro, Pedro Miranda 0002	The Polytope of Fuzzy Measures and Its Adjacency Graph.	MDAI	2008	DBLP DOI BibTeX RDF	combinatorial polytopes, diameter, Fuzzy measures, monotone boolean functions
21	Victor Chepoi, Feodor F. Dragan, Bertrand Estellon, Michel Habib, Yann Vaxès	Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs.	SCG	2008	DBLP DOI BibTeX RDF	delta-hyperbolic space, diameter, center, radius
21	Guihua Hu, Wenhua Zhu, Tao Yu, Jin Yuan	Numerical Simulation and Experimental Study of Liquid-Solid Two-Phase Flow in Nozzle of DIA Jet.	ICIC (3)	2008	DBLP DOI BibTeX RDF	DIA Jet, liquid-solid two-phase flow, the optimum ratio of diameter to length, cutting experiments, numerical simulation
21	Wenhong Wei, Wenjun Xiao	Fault Tolerance in the Biswapped Network.	ICA3PP	2008	DBLP DOI BibTeX RDF	Biswapped network (BSN), Cayley graphs, Network connectivity, Fault diameter
21	Fragiskos Kyriakopoulos, Stefan Thurner	Directed Network Representation of Discrete Dynamical Maps.	International Conference on Computational Science (2)	2007	DBLP DOI BibTeX RDF	network, diameter, node, dynamical maps
21	Bao-Xing Chen, Wenjun Xiao, Behrooz Parhami	Internode Distance and Optimal Routing in a Class of Alternating Group Networks.	IEEE Trans. Computers	2006	DBLP DOI BibTeX RDF	Alternating group graph, internode distance, interconnection network, diameter, Cayley graph, permutation group, optimal routing, shortest-path routing, regular graph
21	Refael Hassin, Asaf Levin	Approximation Algorithms for Quickest Spanning Tree Problems.	Algorithmica	2005	DBLP DOI BibTeX RDF	Quickest path problem, Minimum diameter spanning tree problem, Approximation algorithms
21	Keqin Li	Topological Characteristics of Random Multihop Wireless Networks.	Clust. Comput.	2005	DBLP DOI BibTeX RDF	connectivity, bandwidth, diameter, multihop wireless network, communication latency, random network, biconnectivity
21	William Aiello, Sandeep N. Bhatt, Fan R. K. Chung, Arnold L. Rosenberg, Ramesh K. Sitaraman	Augmented Ring Networks.	IEEE Trans. Parallel Distributed Syst.	2001	DBLP DOI BibTeX RDF	express rings, hierarchical ring networks, diameter trade-offs, graph embedding, Ring networks, multirings, chordal rings, grid graphs
21	Peng-Jun Wan, Liwu Liu, Yuanyuan Yang	Optimal Routing Based on Super Topology in Hypercube WDM Networks.	LCN	1999	DBLP DOI BibTeX RDF	super topology, routing, optical network, distance, diameter, WDM, virtual topology
21	Moses Charikar, Chandra Chekuri, Ashish Goel, Sudipto Guha, Serge A. Plotkin	Approximating a Finite Metric by a Small Number of Tree Metrics.	FOCS	1998	DBLP DOI BibTeX RDF	probabilistic approximation of metric spaces, low diameter partitioning, real normed spaces, algorithms, linear programming, approximation, metric space, derandomization, tree metric
21	Venkatavasu Bokka, Himabindu Gurla, Stephan Olariu, James L. Schwing	Podality-Based Time-Optimal Computations on Enhanced Meshes.	IEEE Trans. Parallel Distributed Syst.	1997	DBLP DOI BibTeX RDF	Podality, enclosing rectangle, Euclidian distance, enhanced meshes, pattern recognition, image processing, lower bounds, convex hull, diameter, time-optimality, Minkowski sum, width
21	H. Isil Bozma, Erdem Kemik	Model-based multi-objective analysis of ultrasound image sequences in prenatal diagnosis.	CVPR	1997	DBLP DOI BibTeX RDF	model-based multi-objective analysis, ultrasound image sequences, prenatal diagnosis, fetus head, bi-parietal diameter measurement, anatomic constraints, coupled differential equations, image sequences, numerical integration, objective function
21	Hui-Ling Huang, Gen-Huey Chen	Shortest-path routing algorithm and topological properties for two-level hypernet networks.	ISPAN	1996	DBLP DOI BibTeX RDF	hypernet, recursively scalable networks, parallel architectures, connectivity, multiprocessor interconnection networks, embedding, diameter, shortest-path routing, topological properties
21	Hossam A. ElGindy, Lachlan Wetherall	A simple Voronoi diagram algorithm for a reconfigurable mesh.	IPPS	1995	DBLP DOI BibTeX RDF	Voronoi diagram algorithm, planar points, worst case running, communication diameter, scheduling, load balancing, computational geometry, reconfigurable architectures, reconfigurable mesh
21	Debasish Das, Bhabani P. Sinha	Multi-Mesh-an efficient topology for parallel processing.	IPPS	1995	DBLP DOI BibTeX RDF	Multi-Mesh network, interconnection scheme, multiple meshes, interconnection pattern, MM network, data elements, routing, parallel processing, parallel architectures, topology, multiprocessor interconnection networks, sorting, communication complexity, matrix multiplication, network routing, diameter, VLSI implementation, matrices
21	Sabine R. Öhring, Maximilian Ibel, Sajal K. Das 0001, Mohan Kumar	On generalized fat trees.	IPPS	1995	DBLP DOI BibTeX RDF	generalized fat trees, multiprocesser interconnection networks, connection machine architecture, pruned butterflies, fat tree based architecture, inner nodes, leaf processors, recursive scalability, maximal fault-tolerance, logarithmic diameter bisection scalability, fault tolerant self-routing, reliability, parallel architectures, fault tolerant computing, broadcasting, hypercubes, multiprocessor interconnection networks, trees, meshes, communication complexity, symmetry, routers, network routing, switches, rings, pyramids, tori, CM-5
21	Mohamed Naimi	Parallel assignment to distinct identities in arbitrary networks.	ICCCN	1995	DBLP DOI BibTeX RDF	sequential distributed algorithm, parallel assignment, distinct identities, parallel distributed algorithm, distributed system nodes, initiator channel, children channel, outgoing channels, upper bound time transmission, parallel algorithms, multiprocessor interconnection networks, time complexity, communication complexity, spanning tree, depth-first search, network diameter, rooted tree, arbitrary network, synchronous distributed systems
21	Linda Gardner, Zevi Miller, Dan Pritikin, Ivan Hal Sudborough	Embedding hypercubes into pancake, cycle prefix and substring reversal networks.	HICSS (2)	1995	DBLP DOI BibTeX RDF	hypercube embedding, graph diameter, pancake network, burnt pancake network, cycle prefix network, substring reversal network, low dilation embeddings, graph theory, generators, hypercube networks, Cayley graphs, group theory, star network, symmetric group
21	Qutaibah M. Malluhi, Magdy A. Bayoumi	The Hierarchical Hypercube: A New Interconnection Topology for Massively Parallel Systems.	IEEE Trans. Parallel Distributed Syst.	1994	DBLP DOI BibTeX RDF	hierarchicalhypercube, logarithmic diameter, one-to-one transfer, divide &conquer class, performance, parallel algorithms, computational complexity, parallels, time complexity, hypercube networks, symmetry, massively parallel systems, interconnection topology, one-to-all broadcasting
21	Elango Ganesan, Dhiraj K. Pradhan	The Hyper-deBruijn Networks: Scalable Versatile Architecture.	IEEE Trans. Parallel Distributed Syst.	1993	DBLP DOI BibTeX RDF	hyper-deBruijn networks, scalable versatile architecture, logarithmic diameter, optimal connectivity, optimal one-to-allbroadcasting, fault-tolerance, parallel architectures, fault tolerant computing, routing algorithms, hypercube networks, VLSI layout, complete binary trees, multiprocessor networks, decomposability, multidimensional meshes
21	David J. Pritchard, Denis A. Nicole	Cube Connected Mobius Ladders: An Inherently Deadlock-Free Fixed Degree Network.	IEEE Trans. Parallel Distributed Syst.	1993	DBLP DOI BibTeX RDF	deadlock-free fixed degree network, cube-connected Mobius ladders, deadlock-free routingstrategy, fixed node degree, fixed degree topology of size, transputernetworks, parallel algorithms, computational complexity, graph theory, topology, Cayley graph, multiprocessorinterconnection network, network diameter, multiprocessor interconnectionnetworks, interval routing
21	Evangelos Kranakis, Nicola Santoro	Distributed Computing on Anonymous Hypercubes with Faulty Components (Extended Abstract).	WDAG	1992	DBLP DOI BibTeX RDF	Anonymous labeled hypercube, faulty component, group of automorphisms, boolean function, diameter
21	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
21	Markus Holopainen, Sakari Tuominen, Mika Karjalainen, Juha Hyyppä, Mikko Vastaranta, Hannu Hyyppä	Accuracy of High-Resolution Radar Images in the Estimation of Plot-Level Forest Variables.	AGILE Conf.	2009	DBLP DOI BibTeX RDF	Forest inventory, forest planning, E-SAR, TerraSAR, aerial photographs, radar imaging, Landsat
21	Evangelos Bampas, Leszek Gasieniec, Nicolas Hanusse, David Ilcinkas, Ralf Klasing, Adrian Kosowski	Euler Tour Lock-In Problem in the Rotor-Router Model.	DISC	2009	DBLP DOI BibTeX RDF
21	Jong-Seok Kim, Hyeong-Ok Lee	Comments on "A Study of Odd Graphs as Fault-Tolerant Interconnection Networks".	IEEE Trans. Computers	2008	DBLP DOI BibTeX RDF	Path and circuit problems, Graph algorithms
21	Emanuele G. Fusco, Andrzej Pelc	Broadcasting in UDG Radio Networks with Missing and Inaccurate Information.	DISC	2008	DBLP DOI BibTeX RDF
21	Mira Park 0001, Jesse S. Jin, Robert Hofstetter, Min Xu 0001, Byeong Ho Kang 0001	Automatic Colonic Polyp Detection by the Mapping Using Regional Unit Sphere.	MUE	2008	DBLP DOI BibTeX RDF	Polyp Detection, Computer Aided Detection
21	Rodrigo de A. Hausen, Luérbio Faria, Celina M. H. de Figueiredo, Luis Antonio Brasil Kowada	On the Toric Graph as a Tool to Handle the Problem of Sorting by Transpositions.	BSB	2008	DBLP DOI BibTeX RDF
21	Leszek Gasieniec, David Peleg, Qin Xin 0001	Faster communication in known topology radio networks.	Distributed Comput.	2007	DBLP DOI BibTeX RDF	Broadcasting, Gossiping, Radio networks
21	Piotr Berman, Shiva Prasad Kasiviswanathan	Faster Approximation of Distances in Graphs.	WADS	2007	DBLP DOI BibTeX RDF
21	Chun-feng Zhao, Chao Xu, Chun-mao Jiao	Reliability Analysis on Vertical Bearing Capacity of Bored Pile Determined by CPT Test.	International Conference on Computational Science (3)	2007	DBLP DOI BibTeX RDF	Correlation distance, CPT, Vertical bearing capacity of pile, Reliability, Random field
21	Jinwei Li, Guiping Liao, Zhongbin Ou, Jing Jin	Rapeseed Seeds Classification by Machine Vision.	IITA	2007	DBLP DOI BibTeX RDF
21	Yiming Ma, Dmitri V. Kalashnikov, Ramaswamy Hariharan, Sharad Mehrotra, Nalini Venkatasubramanian, Naveen Ashish, Jay Lickfett	On-Demand Information Portals for Disaster Situations.	ISI	2007	DBLP DOI BibTeX RDF
21	Pawin Vongmasa, Attawith Sudsang	Coverage Diameters of Polygons.	IROS	2006	DBLP DOI BibTeX RDF
21	Parikshit Gopalan, Phokion G. Kolaitis, Elitza N. Maneva, Christos H. Papadimitriou	The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies.	ICALP (1)	2006	DBLP DOI BibTeX RDF
21	Shirish Karande 0001, Hayder Radha	Influence of Graph Properties of Peer-to-Peer Topologies on Video Streaming with Network Channel Coding.	ICME	2006	DBLP DOI BibTeX RDF
21	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
21	Edmund M. Clarke, Daniel Kroening, Joël Ouaknine, Ofer Strichman	Computational challenges in bounded model checking.	Int. J. Softw. Tools Technol. Transf.	2005	DBLP DOI BibTeX RDF	Bonded-Model-checking, Completeness-Threshold, Complexity
21	Hubert Tsz-Hong Chan, Anupam Gupta 0001, Bruce M. Maggs, Shuheng Zhou	On hierarchical routing in doubling metrics.	SODA	2005	DBLP BibTeX RDF
21	Van Nguyen, Charles U. Martel	Analyzing and characterizing small-world graphs.	SODA	2005	DBLP BibTeX RDF
21	Martin Holzer 0001, Grigorios Prasinos, Frank Schulz 0001, Dorothea Wagner, Christos D. Zaroliagis	Engineering Planar Separator Algorithms.	ESA	2005	DBLP DOI BibTeX RDF
21	Leszek Gasieniec, David Peleg, Qin Xin 0001	Faster communication in known topology radio networks.	PODC	2005	DBLP DOI BibTeX RDF	algorithms, broadcasting, planar graphs, gossiping, radio networks
21	Domingo Gómez-Pérez, Jaime Gutierrez 0001, Álvar Ibeas	Circulant Digraphs and Monomial Ideals.	CASC	2005	DBLP DOI BibTeX RDF
21	James Lowell, Andrew Hunter, David H. Steel, Ansu Basu, Robert Ryder, Richard Lee Kennedy	Measurement of retinal vessel widths from fundus images based on 2-D modeling.	IEEE Trans. Medical Imaging	2004	DBLP DOI BibTeX RDF
21	Feodor F. Dragan, Irina Lomonosov	On Compact and Efficient Routing in Certain Graph Classes.	ISAAC	2004	DBLP DOI BibTeX RDF
21	Dongsheng Li 0001, Xicheng Lu, Jinshu Su	Graph-Theoretic Analysis of Kautz Topology and DHT Schemes.	NPC	2004	DBLP DOI BibTeX RDF
21	Michael Elkin	A faster distributed protocol for constructing a minimum spanning tree.	SODA	2004	DBLP BibTeX RDF
21	Fernando Rodríguez Salazar, John R. Barker	Linear Feedback Shift Register Interconnection Networks.	IPDPS	2004	DBLP DOI BibTeX RDF
21	Joel J. P. C. Rodrigues, Mário M. Freire	Performance Assessment of Signaling Protocols in Optical Burst Switching Mesh Networks.	ICOIN	2004	DBLP DOI BibTeX RDF
21	Gurmeet Singh Manku, Moni Naor, Udi Wieder	Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks.	STOC	2004	DBLP DOI BibTeX RDF	random structures, peer to peer networks, greedy routing
21	Néstor V. Queipo, Luis E. Zerpa, Javier V. Goicochea, Alexander J. Verde, Salvador A. Pintos, Alexander Zambrano	A model for the integrated optimization of oil production systems.	Eng. Comput.	2003	DBLP DOI BibTeX RDF	Integrated surface and reservoir modeling and optimization, Oil production systems
21	William Hesse	Directed graphs requiring large numbers of shortcuts.	SODA	2003	DBLP BibTeX RDF
21	José Jasnau Caeiro, Armando Ventura	Estimation of Anti-bacterial Culture Activity from Digital Images.	IbPRIA	2003	DBLP DOI BibTeX RDF
21	Dmitri Loguinov, Anuj Kumar, Vivek Rai, Sai Ganesh	Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience.	SIGCOMM	2003	DBLP DOI BibTeX RDF	modeling, peer-to-peer, graph theory, DHT, de Bruijn
21	Dongsheng Li 0001, Xinxin Fang, Yijie Wang 0001, Xicheng Lu, Kai Lu, Nong Xiao	A Scalable Peer-to-Peer Network with Constant Degree.	APPT	2003	DBLP DOI BibTeX RDF
21	Mário M. Freire, Rui M. F. Coelho, Joel J. P. C. Rodrigues	High Performance Optical Backbones for Next Generation Internet.	ITCC	2003	DBLP DOI BibTeX RDF
21	Carmen Martínez, Ramón Beivide, Jaime Gutierrez 0001, Cruz Izu	Distance-Hereditary Embeddings of Circulant Graphs.	ITCC	2003	DBLP DOI BibTeX RDF	Ádam´s Conjecture, Cycles, Graph Embedding, Circulant graphs, Chordal Rings
21	Daniel Kroening, Ofer Strichman	Efficient Computation of Recurrence Diameters.	VMCAI	2003	DBLP DOI BibTeX RDF
21	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
21	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
21	Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le	Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems.	ISAAC	2002	DBLP DOI BibTeX RDF
21	Toshinori Takabatake, Masato Kitakami, Hideo Ito	Fault-Tolerant Properties of Generalized Hierarchical Completely-Connected Networks.	PRDC	2002	DBLP DOI BibTeX RDF
21	Behrooz Parhami, Ding-Ming Kwai	A Unified Formulation of Honeycomb and Diamond Networks.	IEEE Trans. Parallel Distributed Syst.	2001	DBLP DOI BibTeX RDF	pruned torus network, network topology, Cayley graph, processor array, VLSI layout, k-ary n-cube
21	Oleg G. Monakhov, Emilia A. Monakhova	Parametrically Described Regular Semigroup Interconnection Networks for Large-Scale Multicomputers.	ISPAN	2000	DBLP DOI BibTeX RDF	Regular interconnection networks, circulant networks, parallel systems, hypercube topologies
21	Behrooz Parhami, Ding-Ming Kwai	Periodically Regular Chordal Rings.	IEEE Trans. Parallel Distributed Syst.	1999	DBLP DOI BibTeX RDF	hierarchical parallel architectures, skip links, fault tolerance, interconnection networks, routing algorithms, greedy routing, Chordal rings
21	Sang Kyun Yun, Kyu Ho Park	Comments on "Hierarchical Cubic Networks".	IEEE Trans. Parallel Distributed Syst.	1998	DBLP DOI BibTeX RDF	hierarchical cubic network(HCN), Interconnection networks, hypercubes, routing algorithm
21	Douglas W. Bass, Ivan Hal Sudborough	Pancake Problems with Restricted Prefix Reversals and some Corresponding Cayley Networks.	ICPP	1998	DBLP DOI BibTeX RDF
21	Susumu Horiguchi, Masayuki Konuki	The Horizontal Rotate Crossed Cube HCQ Interconnection Network.	ISPAN	1997	DBLP DOI BibTeX RDF
21	Xiaoshe Dong, Tomohiro Kudoh, Hideharu Amano	Wavelength Division Multiple Access Ring - Virtual Topology on a Simple Ring Network.	ISPAN	1997	DBLP DOI BibTeX RDF	wavelength division multiple access (WDMA), interconnection network, parallel machine, routing algorithm, optical communication
21	Drago Krznaric, Christos Levcopoulos	Computing Hierarchies of Clusters from the Euclidean Minimum Spanning Tree in Linear Time.	FSTTCS	1995	DBLP DOI BibTeX RDF
21	Leendert M. Huisman, Sandip Kundu	Highly Reliable Symmetric Networks.	IEEE Trans. Parallel Distributed Syst.	1994	DBLP DOI BibTeX RDF	highly reliable symmetric networks, directed loopnetworks, loop-symmetric networks, generalized loop networks, local areanetworks, reliability, connectivity, local area networks