Search results for "k-diameter"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
101	László Babai	On the diameter of Eulerian orientations of graphs.	SODA	2006	DBLP DOI BibTeX RDF
94	Wen-Ting Wu, Jyh-Cheng Chen, Kai-Hsiu Chen, Kuo-Pao Fan	Design and implementation of WIRE Diameter.	ITRE	2005	DBLP DOI BibTeX RDF
85	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
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
75	Marcelo M. de Azevedo, Nader Bagherzadeh, Shahram Latifi	Fault-diameter of the star-connected cycles interconnection network.	HICSS (2)	1995	DBLP DOI BibTeX RDF	star-connected cycles interconnection network, maximum diameter, fault-free, fixed constant, fault tolerance, reliability, graph theory, parallel architectures, fault tolerant computing, graph, multiprocessor interconnection networks, vertex connectivity, fault-diameter
74	Khaled Day, Abdel Elah Al-Ayyoub	Minimal Fault Diameter for Highly Resilient Product Networks.	IEEE Trans. Parallel Distributed Syst.	2000	DBLP DOI BibTeX RDF	fault tolerance, interconnection networks, node-disjoint paths, product networks, Fault diameter
68	Kiyomi Sakamoto, Shoichi Aoyama, Shigeo Asahara, Haruki Mizushina, Hirohiko Kaneko	Relationship between Emotional State and Pupil Diameter Variability under Various Types of Workload Stress.	HCI (15)	2009	DBLP DOI BibTeX RDF	Pupil diameter, audio stimuli, psychological state, variability in pupil diameter
67	Hervé Fournier, Antoine Vigneron	Lower Bounds for Geometric Diameter Problems.	LATIN	2006	DBLP DOI BibTeX RDF	Hopcroft’s problem, Computational geometry, Lower bound, Diameter, Convex polytope
64	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
61	Clémence Magnien, Matthieu Latapy, Michel Habib	Fast computation of empirically tight bounds for the diameter of massive graphs.	ACM J. Exp. Algorithmics	2008	DBLP DOI BibTeX RDF	Diameter bounds, graph diameter
61	T.-H. Hubert Chan, Anupam Gupta 0001	Small Hop-diameter Sparse Spanners for Doubling Metrics.	Discret. Comput. Geom.	2009	DBLP DOI BibTeX RDF	Hop diameter, Algorithms, Doubling metrics, Sparse spanners
61	Hervé Fournier, Antoine Vigneron	A Tight Lower Bound for Computing the Diameter of a 3D Convex Polytope.	Algorithmica	2007	DBLP DOI BibTeX RDF	Hopcroft’s problem, Computational geometry, Lower bound, Diameter, Convex polytope
61	Joan Feigenbaum, Sampath Kannan, Jian Zhang 0004	Computing Diameter in the Streaming and Sliding-Window Models.	Algorithmica	2005	DBLP DOI BibTeX RDF	Massive data streams, Diameter, Sliding window
60	Jason Baumgartner, Andreas Kuehlmann	Enhanced Diameter Bounding via Structural.	DATE	2004	DBLP DOI BibTeX RDF
60	Fedor V. Fomin, Martín Matamala, Ivan Rapaport	The Complexity of Approximating the Oriented Diameter of Chordal Graphs.	WG	2002	DBLP DOI BibTeX RDF
54	Rami G. Melhem	Low Diameter Interconnections for Routing in High-Performance Parallel Systems.	IEEE Trans. Computers	2007	DBLP DOI BibTeX RDF	fixed diameter graphs, low diameter networks, Interconnection networks, directed graphs, circuit switching, deterministic routing
54	Dikran S. Meliksetian, C. Y. Roger Chen	Optimal Routing Algorithm and the Diameter of the Cube-Connected Cycles.	IEEE Trans. Parallel Distributed Syst.	1993	DBLP DOI BibTeX RDF	multiprocessor structure, exact network diameter, fault tolerant computing, hypercube networks, diameter, cube-connected cycles, performanceevaluation, optimal routing algorithm
54	Bayram Akdemir, Salih Günes, Bülent Oran	Prediction of Aortic Diameter Values in Healthy Turkish Infants, Children and Adolescents Via Adaptive Network Based Fuzzy Inference System.	ICIC (1)	2008	DBLP DOI BibTeX RDF	Aortic Diameter, Line Base Normalization Method, Prediction, ANFIS
54	Yefim Dinitz, Tamar Eilam, Shlomo Moran, Shmuel Zaks	On the totalk-diameter of connection networks.	ISTCS	1997	DBLP DOI BibTeX RDF	k edge-disjoint paths, minimal sum of lengths, fault-tolerant routing problems, k-connected simple graph, total/sub k/-diameter, graph theory, lower bound, ATM networks, upper bound, nodes, compact routing, connection network
53	Sanjiv Kapoor, Mohammad Sarwat	Bounded-Diameter Minimum-Cost Graph Problems.	Theory Comput. Syst.	2007	DBLP DOI BibTeX RDF
53	Yusuke Sasaki, Hiroyoshi Miwa	A Control Method of a P2P Network with Small Degree and Diameter.	HIS	2007	DBLP DOI BibTeX RDF
53	Hsun-Wen Chang, San-Yu Chen	The 3-Wide-Diameter of the Hyper-L Triple-Loop Network.	PDCAT	2006	DBLP DOI BibTeX RDF
53	Refael Hassin, Asaf Levin	Minimum Restricted Diameter Spanning Trees.	APPROX	2002	DBLP DOI BibTeX RDF
50	Ding-Zhu Du, Yuh-Dauh Lyuu, D. Frank Hsu	Line Digraph Iterations and Spread Concept - with Application to Graph Theory, Fault Tolerance, and Routing.	WG	1991	DBLP DOI BibTeX RDF	line digraph iteration, diameter vulnerability, k-diameter, fault tolerance, graph, connectivity, container, de Bruijn graph, spread, Kautz graph
48	Konstantinos Georgiou, Periklis A. Papakonstantinou	Complexity and Algorithms for Well-Structured k-SAT Instances.	SAT	2008	DBLP DOI BibTeX RDF
48	Jong-Seok Kim, Eunseuk Oh, Hyeong-Ok Lee, Yeong-Nam Heo	Topological and Communication Aspects of Hyper-Star Graphs.	ISCIS	2003	DBLP DOI BibTeX RDF
47	Martin Gruber, Günther R. Raidl	Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances.	GECCO	2009	DBLP DOI BibTeX RDF	bounded diameter minimum spanning tree, construction heuristics, greedy randomized search, local improvement, dynamic programming
47	Krists Boitmanis, Karlis Freivalds, Peteris Ledins, Rudolfs Opmanis	Fast and Simple Approximation of the Diameter and Radius of a Graph.	WEA	2006	DBLP DOI BibTeX RDF	graph diameter, graph algorithms, analysis of algorithms, algorithm engineering, approximation techniques
47	Khaled Day, Abdel Elah Al-Ayyoub	Fault Diameter of k-ary n-cube Networks.	IEEE Trans. Parallel Distributed Syst.	1997	DBLP DOI BibTeX RDF	interconnection networks, torus, k-ary n-cube, node-disjoint paths, Fault diameter
47	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
47	Sing-Ban Tien, Cauligi S. Raghavendra	Algorithms and Bounds for Shortest Paths and Diameter in Faulty Hypercubes.	IEEE Trans. Parallel Distributed Syst.	1993	DBLP DOI BibTeX RDF	n-dimensional hypercube, parallel algorithms, computational complexity, complexity, fault tolerant computing, shortest paths, hypercube networks, diameter, bounds, faulty hypercubes
46	T.-H. Hubert Chan, Anupam Gupta 0001	Small hop-diameter sparse spanners for doubling metrics.	SODA	2006	DBLP DOI BibTeX RDF
46	Daijue Tang, Yinlei Yu, Darsh Ranjan, Sharad Malik	Analysis of Search Based Algorithms for Satisfiability of Propositional and Quantified Boolean Formulas Arising from Circuit State Space Diameter Problems.	SAT (Selected Papers	2004	DBLP DOI BibTeX RDF
46	Hae Dong Lee, Byung Gil Lee, Hyung Gon Kim	Design of Peer State Acquisition Mechanism for Efficient Dynamic HA Allocation at Diameter-Based AAA Server.	CDMA International Conference	2002	DBLP DOI BibTeX RDF
46	Sang Keun Yoo, Hyun Gon Kim, Seung Won Sohn	Enhancement of Failover Using Application Layer Watchdog and SCTP Heartbeat in Diameter.	CDMA International Conference	2002	DBLP DOI BibTeX RDF
46	Sun Hwa Lim, Jung Mo Mun, Yeong Jin Kim, Sun Bae Lim	Design of Protocol Conversion Gateway Based on Diameter for Interworking between Wireless LANs.	CDMA International Conference	2002	DBLP DOI BibTeX RDF
43	Jing Huang 0007, Dong Ye 0002	Sharp Bounds for the Oriented Diameters of Interval Graphs and 2-Connected Proper Interval Graphs.	International Conference on Computational Science (3)	2007	DBLP DOI BibTeX RDF	oriented diameter, proper interval graph, orientation, Diameter, interval graph
43	Behrooz Parhami, Mikhail A. Rakov	Perfect Difference Networks and Related Interconnection Structures for Parallel and Distributed Systems.	IEEE Trans. Parallel Distributed Syst.	2005	DBLP DOI BibTeX RDF	hyperstar, low-diameter network, two-hop connectivity, interconnection network, Bipartite graph, diameter, degree, chordal ring, regular network, bisection width
43	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
42	Silvio Lattanzi, D. Sivakumar 0001	Affiliation networks.	STOC	2009	DBLP DOI BibTeX RDF	densification, social networks, diameter, sparsification
42	Michele Flammini, Luca Moscardelli, Alfredo Navarra, Stéphane Pérennes	Asymptotically Optimal Solutions for Small World Graphs.	Theory Comput. Syst.	2008	DBLP DOI BibTeX RDF	Oblivious diameter, Social networks, Small world graph
42	Charles U. Martel, Van Nguyen	Analyzing Kleinberg's (and other) small-world Models.	PODC	2004	DBLP DOI BibTeX RDF	routing, random graphs, diameter, small-world network
41	Hyeong-Ok Lee, Jong-Seok Kim, Eunseuk Oh, Hyeong-Seok Lim	Hyper-Star Graph: A New Interconnection Network Improving the Network Cost of the Hypercube.	EurAsia-ICT	2002	DBLP DOI BibTeX RDF
40	Ying Gao, Armando Barreto, Malek Adjouadi	Monitoring and Processing of the Pupil Diameter Signal for Affective Assessment of a Computer User.	HCI (1)	2009	DBLP DOI BibTeX RDF	Pupil diameter (PD), Pupillary light reflex (PLR), Pupillary affective response (PAR), Adaptive Interference Canceller (AIC), H??? time-varying (HITV) adaptive algorithm
40	Yu. G. Nikonorov, Y. V. Nikonorova	The Intrinsic Diameter of the Surface of a Parallelepiped.	Discret. Comput. Geom.	2008	DBLP DOI BibTeX RDF	Convex surface, Rectangular parallelepiped, Intrinsic distance, Intrinsic diameter, Surface area
40	Armando Barreto, Ying Gao, Malek Adjouadi	Pupil diameter measurements: untapped potential to enhance computer interaction for eye tracker users?	ASSETS	2008	DBLP DOI BibTeX RDF	pupil diameter, stress, frustration, eye gaze tracking
40	Alok Singh 0001, Ashok Kumar Gupta	Improved heuristics for the bounded-diameter minimum spanning tree problem.	Soft Comput.	2007	DBLP DOI BibTeX RDF	Bounded-diameter minimum spanning tree problem, Uniform order-based crossover, Constrained optimization, Greedy heuristic, Steady-state genetic algorithm
40	Iztok Banic, Janez Zerovnik	Edge Fault-Diameter of Cartesian Product of Graphs.	SIROCCO	2007	DBLP DOI BibTeX RDF	Cartesian graph products, edge fault-diameter, interconnection network
40	Luis Eduardo Neves Gouveia, Thomas L. Magnanti, Cristina Requejo	An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees.	Ann. Oper. Res.	2006	DBLP DOI BibTeX RDF	Diameter constrained trees, Hop-indexed models, Network flows
40	Victor Chepoi, Bertrand Estellon, Karim Nouioua, Yann Vaxès	Mixed Covering of Trees and the Augmentation Problem with Odd Diameter Constraints.	Algorithmica	2006	DBLP DOI BibTeX RDF	Augmentation problem, Approximation algorithms, Dynamical programming, Diameter, Partial covering
40	Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal 0001, Jack Snoeyink	Computing a (1+epsilon)-Approximate Geometric Minimum-Diameter Spanning Tree.	Algorithmica	2004	DBLP DOI BibTeX RDF	Minimum diameter spanning tree, Approximation algorithm, Geometric graph
40	Ming-Chun Tsai, Hung-Lin Fu	Edge Number of 3-Connected Diameter 3 Graphs.	ISPAN	2004	DBLP DOI BibTeX RDF	decay number, edge number, connectivity, diameter
40	Victor Chepoi, Yann Vaxès	Augmenting Trees to Meet Biconnectivity and Diameter Constraints.	Algorithmica	2002	DBLP DOI BibTeX RDF	Biconnectivity augmentation, Approximation algorithms, Trees, Diameter, Radius
40	Hans-Christoph Wirth, Jan Steffan	On Minimum Diameter Spanning Trees under Reload Costs.	WG	1999	DBLP DOI BibTeX RDF	Node weighted graphs, Network Design, Spanning Tree, Diameter, Transportation problems
39	Bin Fu, Zhiyu Zhao	Separating Sublinear Time Computations by Approximate Diameter.	COCOA	2008	DBLP DOI BibTeX RDF
39	Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Udi Wieder	Strong-diameter decompositions of minor free graphs.	SPAA	2007	DBLP DOI BibTeX RDF	minor free graphs, compact routing
39	Zvi Lotker, Boaz Patt-Shamir, David Peleg	Distributed MST for constant diameter graphs.	Distributed Comput.	2006	DBLP DOI BibTeX RDF	Minimum-weight spanning tree, Distributed algorithm
39	Shogo Asai, Yuusuke Kounoike, Yuji Shinano, Keiichi Kaneko	Computing the Diameter of 17-Pancake Graph Using a PC Cluster.	Euro-Par	2006	DBLP DOI BibTeX RDF
39	Duncan E. Donohue, Giorgio A. Ascoli	Local Diameter Fully Constrains Dendritic Size in Basal but not Apical Trees of CA1 Pyramidal Neurons.	J. Comput. Neurosci.	2005	DBLP DOI BibTeX RDF	dendritic structure, pyramidal cells, computational models, morphology, three-dimensional reconstructions
39	Roberto Accorsi, Scott D. Metzler	Analytic determination of the resolution-equivalent effective diameter of a pinhole collimator.	IEEE Trans. Medical Imaging	2004	DBLP DOI BibTeX RDF
39	Jun (Jim) Xu, Abhishek Kumar 0003, Xingxing Yu	On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks.	IEEE J. Sel. Areas Commun.	2004	DBLP DOI BibTeX RDF
39	Sariel Har-Peled	A practical approach for computing the diameter of a point set.	SCG	2001	DBLP DOI BibTeX RDF
39	Zvi Lotker, Boaz Patt-Shamir, David Peleg	Distributed MST for constant diameter graphs.	PODC	2001	DBLP DOI BibTeX RDF
39	Joseph O'Rourke, Catherine A. Schevon	Computing the Geodesic Diameter of a 3-Polytope.	SCG	1989	DBLP DOI BibTeX RDF
39	Jan-Ming Ho, D. T. Lee, Chia-Hsiang Chang	Bounded-Diameter Minimum Spanning Trees and Related Problems.	SCG	1989	DBLP DOI BibTeX RDF
35	Jianqin Zhou, Wenjuan Wang	On Constructions of Optimal Double-Loop Networks.	ICIC (2)	2008	DBLP DOI BibTeX RDF	tight optimal, L-shaped tile, algorithm, Diameter, double-loop network
35	Dmitri Loguinov, Juan Casas, Xiaoming Wang 0002	Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience.	IEEE/ACM Trans. Netw.	2005	DBLP DOI BibTeX RDF	De Bruijn graphs, diameter-degree tradeoff, peer-to-peer networks
35	Lee-Juan Fan, Chang-Biau Yang, Shyue-Horng Shiau	Routing Algorithms on the Bus-Based Hypercube Network.	IEEE Trans. Parallel Distributed Syst.	2005	DBLP DOI BibTeX RDF	Multiple-bus network, fault tolerance, hypercube, routing algorithm, diameter
35	Behrooz Parhami, Mikhail A. Rakov	Performance, Algorithmic, and Robustness Attributes of Perfect Difference Networks.	IEEE Trans. Parallel Distributed Syst.	2005	DBLP DOI BibTeX RDF	hyperstar, robust network, fault tolerance, scalability, interconnection network, routing algorithm, emulation, Bipartite graph, diameter, permutation routing, chordal ring
35	Bao-Xing Chen, Wenjun Xiao	Optimal Designs of Directed Double-Loop Networks.	CIS	2004	DBLP DOI BibTeX RDF	directed double-loop networks, k-tight optimal, diameter, optimal design
35	Jean-Claude Bermond, Sébastien Choplin, Stephane Perennes	Hierarchical Ring Network design.	Theory Comput. Syst.	2003	DBLP DOI BibTeX RDF	Combinatorial Optimization, Network Design, Diameter, Ring Networks
35	Jean-Claude Bermond, Nausica Marlin, David Peleg, Stephane Perennes	Directed Virtual Path Layouts in ATM Networks.	DISC	1998	DBLP DOI BibTeX RDF	Virtual path layout, ATM, Embedding, diameter
34	Suleman Surti, Joel S. Karp, Lucretiu M. Popescu, Margaret E. Daube-Witherspoon, Matthew E. Werner	Investigation of time-of-flight benefit for fully 3-DPET.	IEEE Trans. Medical Imaging	2006	DBLP DOI BibTeX RDF
34	Dongsheng Li 0001, Xicheng Lu, Jie Wu 0001	FISSIONE: a scalable constant degree and low congestion DHT scheme based on Kautz graphs.	INFOCOM	2005	DBLP DOI BibTeX RDF
34	Yuusuke Kounoike, Keiichi Kaneko, Yuji Shinano	Computing the Diameters of 14- and 15-Pancake Graphs.	ISPAN	2005	DBLP DOI BibTeX RDF
34	Reza Mohammadi 0004, Warren H. Finlay, Wilson H.-Y. Roa, Alidad Amirfazli	Determination of Contact Angle of Microspheres by Microscopy Methods.	ICMENS	2003	DBLP DOI BibTeX RDF
34	Sanguthevar Rajasekaran, Thanasis Tsantilas	An Optimal Randomized Routing Algorithm for the Mesh and A Class of Efficient Mesh-like Routing Networks.	FSTTCS	1987	DBLP DOI BibTeX RDF
33	Ye Xu, Zhuo Wang 0004, Wenbo Zhang	On Traveling Diameter of an Instance of Complex Networks - Internet.	Complex (1)	2009	DBLP DOI BibTeX RDF	Internet traveling diameter, chaos, GA, Logistic Model, correlation dimension
33	Fangqing Gu, Hai-Lin Liu 0001, Wei Liu	A bounded diameter minimum spanning tree evolutionary algorithm based on double chromosome.	GEC Summit	2009	DBLP DOI BibTeX RDF	double chromosome, the bounded diameter minimum spanning tree, evolutionary algorithm, local search
33	Huynh Thi Thanh Binh, Robert I. McKay, Nguyen Xuan Hoai, Nguyen Duc Nghia	New heuristic and hybrid genetic algorithm for solving the bounded diameter minimum spanning tree problem.	GECCO	2009	DBLP DOI BibTeX RDF	bounded diameter minimum spanning tree, heuristic algorithm, hybrid genetic algorithm, multi-parent crossover
33	Ning Zhang, Incheol Shin, Feng Zou, Weili Wu 0001, My T. Thai	Trade-off scheme for fault tolerant connected dominating sets on size and diameter.	FOWANC	2008	DBLP DOI BibTeX RDF	bounded diameter, fault tolerance, wireless ad-hoc networks, connected dominating set
33	Md. Abdur Razzaque, Choong Seon Hong, Mohammad Abdullah-Al-Wadud, Oksam Chae	A Fast Algorithm to Calculate Powers of a Boolean Matrix for Diameter Computation of Random Graphs.	WALCOM	2008	DBLP DOI BibTeX RDF	Boolean Matrix, Graph Diameter, Computational Complexity, Random Graphs, Adjacency Matrix
33	Matthew O. Jackson	Average Distance, Diameter, and Clustering in Social Networks with Homophily.	WINE	2008	DBLP DOI BibTeX RDF	Segregation, Clustering, Social Networks, Networks, Random Graphs, Diameter, Friendships, Average Distance, Homophily
33	Martin Gruber, Günther R. Raidl	Heuristic Cut Separation in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem.	SAINT	2008	DBLP DOI BibTeX RDF	bounded diameter minimum spanning tree, local search, tabu search, branch-and-cut
33	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
33	Qunfang Hu, Hongwei Huang	Numerical Analysis and Risk Assessment on Face Stability of Large-Diameter Tunnels.	International Conference on Computational Science (3)	2007	DBLP DOI BibTeX RDF	face stability, large-diameter tunnel, risk assessment, numerical analysis
33	Martin Gruber, Jano I. van Hemert, Günther R. Raidl	Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO.	GECCO	2006	DBLP DOI BibTeX RDF	bounded diameter minimum spanning tree problem, variable neighbourhood search, evolutionary computation, ant colony optimisation
33	Mirela Damian, Sriram V. Pemmaraju	Computing Optimal Diameter-Bounded Polygon Partitions.	Algorithmica	2004	DBLP DOI BibTeX RDF	Diameter-bounded, Approximation algorithm, Polygon decomposition
33	Nak-Keun Joo, Hyeong-Seok Lim	A new interconnection network for parallel computer with low diameter.	ICPADS	1997	DBLP DOI BibTeX RDF	low diameter, graycube, dialation 2, hypercube embedding, routing, parallel computer, interconnection network, hypercube networks, broadcasting algorithms, recursive structure
33	L. R. Nochefranca, P. W. Sy	The diameter of the generalized de Bruijn graph UGB(n, n(n2+1)).	ISPAN	1997	DBLP DOI BibTeX RDF	generalized de Bruijn graph, graph theory, diameter, de Bruijn graph
33	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
32	Dae-Young Seo, D. T. Lee, Tien-Ching Lin	Geometric Minimum Diameter Minimum Cost Spanning Tree Problem.	ISAAC	2009	DBLP DOI BibTeX RDF
32	Alberto Pettarin, Andrea Pietracaprina, Geppino Pucci	On the Expansion and Diameter of Bluetooth-Like Topologies.	ESA	2009	DBLP DOI BibTeX RDF
32	Martin Gruber, Günther R. Raidl	Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics.	EUROCAST	2009	DBLP DOI BibTeX RDF
32	Rui Yang, Shijie Zhou, Chengyu Fan	A New Algorithm for Network Diameter.	ICYCS	2008	DBLP DOI BibTeX RDF
32	Alauddin Bhuiyan, Baikunth Nath, Joselíto J. Chua, Kotagiri Ramamohanarao	Vessel Cross-Sectional Diameter Measurement on Color Retinal Image.	BIOSTEC (Selected Papers)	2008	DBLP DOI BibTeX RDF	Vessel Cross-section, Adaptive Region Growing Technique, Gabor Energy Filter Bank, Texture Classification, Fuzzy C-Means Clustering, Gradient Operator
32	Knut-Helge Vik, Pål Halvorsen, Carsten Griwodz	Multicast Tree Diameter for Dynamic Distributed Interactive Applications.	INFOCOM	2008	DBLP DOI BibTeX RDF
32	Vincenzo Gemignani, Francesco Faita, Lorenzo Ghiadoni, Elisa Poggianti, Marcello Demi	A System for Real-Time Measurement of the Brachial Artery Diameter in B-Mode Ultrasound Images.	IEEE Trans. Medical Imaging	2007	DBLP DOI BibTeX RDF
32	Rajib K. Das	Diameter and Routing in Enhanced OTIS Cube.	ICCTA	2007	DBLP DOI BibTeX RDF
32	Augustin Chaintreau, Abderrahmen Mtibaa, Laurent Massoulié, Christophe Diot	The diameter of opportunistic mobile networks.	CoNEXT	2007	DBLP DOI BibTeX RDF