Search results for "diameter"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
4	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	2009	DBLP DOI BibTeX RDF	Pupil diameter, audio stimuli, psychological state, variability in pupil diameter
4	Clémence Magnien, Matthieu Latapy, Michel Habib	Fast computation of empirically tight bounds for the diameter of massive graphs.	ACM Journal of Experimental Algorithmics	2008	DBLP DOI BibTeX RDF	Diameter bounds, graph diameter
4	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
4	Marcelo M. de Azevedo, Nader Bagherzadeh, Shahram Latifi	Fault-diameter of the star-connected cycles interconnection network.	HICSS	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
4	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 Distrib. Syst.	1995	DBLP DOI BibTeX RDF	?-wide diameter, node-fault diameter, interconnection network, connectivity, embedding, routing algorithm, diameter, container, Broadcasting algorithm, Hamiltonian circuit
4	Dikran S. Meliksetian, C. Y. Roger Chen	Optimal Routing Algorithm and the Diameter of the Cube-Connected Cycles.	IEEE Trans. Parallel Distrib. Syst.	1993	DBLP DOI BibTeX RDF	multiprocessor structure, exact network diameter, fault tolerant computing, hypercube networks, diameter, cube-connected cycles, performanceevaluation, optimal routing algorithm
3	T.-H. Hubert Chan, Anupam Gupta	Small Hop-diameter Sparse Spanners for Doubling Metrics.	Discrete & Computational Geometry	2009	DBLP DOI BibTeX RDF	Hop diameter, Algorithms, Doubling metrics, Sparse spanners
3	Fangqing Gu, Hailin Liu, 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
3	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
3	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
3	Ying Gao, Armando Barreto, Malek Adjouadi	Monitoring and Processing of the Pupil Diameter Signal for Affective Assessment of a Computer User.	HCI	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
3	Ye Xu, Zhuo Wang, Wen-bo Zhang	On Traveling Diameter of an Instance of Complex Networks - Internet.	Complex	2009	DBLP DOI BibTeX RDF	Internet traveling diameter, chaos, GA, Logistic Model, correlation dimension
3	Y. G. Nikonorov, Y. V. Nikonorova	The Intrinsic Diameter of the Surface of a Parallelepiped.	Discrete & Computational Geometry	2008	DBLP DOI BibTeX RDF	Convex surface, Rectangular parallelepiped, Intrinsic distance, Intrinsic diameter, Surface area
3	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	2008	DBLP DOI BibTeX RDF	Aortic Diameter, Line Base Normalization Method, Prediction, ANFIS
3	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
3	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
3	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
3	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
3	Ning Zhang, Incheol Shin, Feng Zou, Weili Wu, 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
3	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
3	Alok Singh, 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
3	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
3	Qunfang Hu, Hongwei Huang	Numerical Analysis and Risk Assessment on Face Stability of Large-Diameter Tunnels.	International Conference on Computational Science	2007	DBLP DOI BibTeX RDF	face stability, large-diameter tunnel, risk assessment, numerical analysis
3	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
3	Jing Huang, Dong Ye	Sharp Bounds for the Oriented Diameters of Interval Graphs and 2-Connected Proper Interval Graphs.	International Conference on Computational Science	2007	DBLP DOI BibTeX RDF	oriented diameter, proper interval graph, orientation, Diameter, interval graph
3	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
3	Luis Gouveia, Thomas L. Magnanti, Cristina Requejo	An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees.	Annals OR	2006	DBLP DOI BibTeX RDF	Diameter constrained trees, Hop-indexed models, Network flows
3	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
3	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
3	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
3	Behrooz Parhami, Mikhail A. Rakov	Perfect Difference Networks and Related Interconnection Structures for Parallel and Distributed Systems.	IEEE Trans. Parallel Distrib. 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
3	Mirela Damian, Sriram V. Pemmaraju	Computing Optimal Diameter-Bounded Polygon Partitions.	Algorithmica	2004	DBLP DOI BibTeX RDF	Diameter-bounded, Approximation algorithm, Polygon decomposition
3	Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, 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
3	Joan Feigenbaum, Sampath Kannan, Jian Zhang 0004	Computing Diameter in the Streaming and Sliding-Window Models.	Algorithmica	2004	DBLP DOI BibTeX RDF	Massive data streams, Diameter, Sliding window
3	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
3	Jun-Ming Xu	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
3	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
3	Khaled Day, Abdel Elah Al-Ayyoub	Minimal Fault Diameter for Highly Resilient Product Networks.	IEEE Trans. Parallel Distrib. Syst.	2000	DBLP DOI BibTeX RDF	fault tolerance, interconnection networks, node-disjoint paths, product networks, Fault diameter
3	Chien-Ping Chang, Ting-Yi Sung, Lih-Hsing Hsu	Edge Congestion and Topological Properties of Crossed Cubes.	IEEE Trans. Parallel Distrib. Syst.	2000	DBLP DOI BibTeX RDF	edge congestion, hypercubes, embedding, shortest path routing, wide diameter, fault diameter, Crossed cubes, bisection width
3	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
3	Hui-Ling Huang, Gen-Huey Chen	Combinatorial Properties of Two-Level Hypernet Networks.	IEEE Trans. Parallel Distrib. Syst.	1999	DBLP DOI BibTeX RDF	Best container, hypernet network, container, graph-theoretic interconnection network, wide diameter, fault diameter
3	Khaled Day, Abdel Elah Al-Ayyoub	Fault Diameter of k-ary n-cube Networks.	IEEE Trans. Parallel Distrib. Syst.	1997	DBLP DOI BibTeX RDF	interconnection networks, torus, k-ary n-cube, node-disjoint paths, Fault diameter
3	Nak-Keun Joo, Hyeong-Seok Lim	A new interconnection network for parallel computer with low diameter. (PDF / PS)	ICPADS	1997	DBLP DOI BibTeX RDF	low diameter, graycube, dialation 2, hypercube embedding, routing, parallel computer, interconnection network, hypercube networks, broadcasting algorithms, recursive structure
3	Yefim Dinitz, Tamar Eilam, Shlomo Moran, Shmuel Zaks	On the totalk-diameter of connection networks. (PDF / PS)	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
3	L. R. Nochefranca, P. W. Sy	The diameter of the generalized de Bruijn graph UG/sub B/(n, n(n/sup 2/+1)).	ISPAN	1997	DBLP DOI BibTeX RDF	generalized de Bruijn graph, graph theory, diameter, de Bruijn graph
3	H. E. Escuardro, Felix P. Muga II	Wide-diameter of generalized undirected de Bruijn graph UG/sub B/(n, n/sup 2/).	ISPAN	1997	DBLP DOI BibTeX RDF	undirected, graph theory, digraph, de Bruijn graph, wide-diameter
3	Jaime D. L. Caro, Luz R. Nochefranca, Polly W. Sy, Felix P. Muga II	The wide-diameter of the generalized de Bruijn graphs UG/sub B/(n, n(n+1)).	ISPAN	1996	DBLP DOI BibTeX RDF	generalized de Bruijn graphs, graph theory, de Bruijn graphs, wide-diameter
3	Sing-Ban Tien, C. S. Raghavendra	Algorithms and Bounds for Shortest Paths and Diameter in Faulty Hypercubes.	IEEE Trans. Parallel Distrib. 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
3	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
2	Fadi N. Sibai	Low Diameter Unicast On-Chip Interconnection Networks for Many-Core Embedded Systems.	CISIS	2010	DBLP DOI BibTeX RDF	many core embedded systems, On-chip interconnection networks, network diameter
2	Aparna Das, Claire Kenyon-Mathieu	On Hierarchical Diameter-Clustering and the Supplier Problem.	Theory Comput. Syst.	2009	DBLP DOI BibTeX RDF	Approximation algorithm, Online algorithm, Hierarchical clustering
2	Rajeev Kumar, Bipul Kumar Bal, Peter Rockett	Multiobjective genetic programming approach to evolving heuristics for the bounded diameter minimum spanning tree problem: MOGP for BDMST.	GECCO	2009	DBLP DOI BibTeX RDF	genetic algorithm, genetic programming, heuristics, combinatorial optimization, multiobjective optimization, optimization methods, bloat, pareto front
2	Alberto Pettarin, Andrea Pietracaprina, Geppino Pucci	On the Expansion and Diameter of Bluetooth-Like Topologies.	ESA	2009	DBLP DOI BibTeX RDF
2	Friedrich Eisenbrand, Nicolai Hähnle, Thomas Rothvoß	Diameter of polyhedra: limits of abstraction.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	disjoint coverings, hirsch conjecture, polyhedra, convex geometry
2	Mustafa Emre Karagozler, Seth Copen Goldstein, James Robert Reid	Stress-driven MEMS assembly + electrostatic forces = 1mm diameter robot.	IROS	2009	DBLP DOI BibTeX RDF
2	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
2	Dae Young Seo, D. T. Lee, Tien-Ching Lin	Geometric Minimum Diameter Minimum Cost Spanning Tree Problem.	ISAAC	2009	DBLP DOI BibTeX RDF
2	Yi Xu, Yu Du, Bo Zhao, Xiuyi Zhou, Youtao Zhang, Jun Yang 0002	A low-radix and low-diameter 3D interconnection network design.	HPCA	2009	DBLP DOI BibTeX RDF
2	Silvio Lattanzi, D. Sivakumar	Affiliation networks.	STOC	2009	DBLP DOI BibTeX RDF	densification, social networks, diameter, sparsification
2	Zheng-Bin Dong, Guo-Jie Song, Kun-Qing Xie, Jing-Yao 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
2	Zhengbin Dong, Wenjie Wu, Xiujun Ma, Kunqing Xie, Fengjun Jin	Mining the Structure and Evolution of the Airport Network of China over the Past Twenty Years.	ADMA	2009	DBLP DOI BibTeX RDF	Airport Network of China, ANC, betweeness centrality, network structure, network diameter, degree distribution, network evolution, clustering coefficient
2	Tjerk de Greef, Harmen Lafeber, Herre van Oostendorp, Jasper Lindenberg	Eye Movement as Indicators of Mental Workload to Trigger Adaptive Automation.	HCI	2009	DBLP DOI BibTeX RDF	pupil diameter, fixation time, eye movement, saccade, mental workload, adaptive automation
2	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
2	Atlas F. Cook, Carola Wenk	Shortest Path Problems on a Polyhedral Surface.	WADS	2009	DBLP DOI BibTeX RDF	Fréchet distance, Voronoi Diagram, Diameter, Polyhedral Surface, Shortest Path Map
2	Antoine Deza, Tamás Terlaky, Yuriy Zinchenko	A Continuous d -Step Conjecture for Polytopes.	Discrete & Computational Geometry	2009	DBLP DOI BibTeX RDF	Hirsch conjecture, d-Step conjecture, Diameter, Curvature, Polytopes, Central path
2	Micha A. Perles, Horst Martini, Yaakov S. Kupitz	A Jordan-Brouwer Separation Theorem for Polyhedral Pseudomanifolds.	Discrete & Computational Geometry	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
2	Lior Shapira, Ariel Shamir, Daniel Cohen-Or	Consistent mesh partitioning and skeletonisation using the shape diameter function.	The Visual Computer	2008	DBLP DOI BibTeX RDF	Geometry processing, Skeleton extraction, Mesh decomposition
2	Wenjun Xiao, Wenhong Wei, Weidong Chen, Mingxin He, Behrooz Parhami	Comments on "Low Diameter Interconnections for Routing in High-Performance Parallel Systems, " with Connections and Extensions to Arc Coloring of Coset Graphs.	IEEE Trans. Computers	2008	DBLP DOI BibTeX RDF
2	Telma Woerle de Lima, Franz Rothlauf, Alexandre C. B. Delbem	The node-depth encoding: analysis and application to the bounded-diameter minimum spanning tree problem.	GECCO	2008	DBLP DOI BibTeX RDF	genetic algorithms, performance analysis, representations
2	Beat Gfeller	Faster Swap Edge Computation in Minimum Diameter Spanning Trees.	ESA	2008	DBLP DOI BibTeX RDF
2	Amos Brocco, Fulvio Frapolli, Béat Hirsbrunner	BlåtAnt: Bounding Networks' Diameter with a Collaborative Distributed Algorithm.	ANTS Conference	2008	DBLP DOI BibTeX RDF
2	Hoon Lim, Jae Youn Choi, Young Sik Kwon, Eui-Jung Jung, Byung-Ju Yi	SLAM in indoor pipelines with 15mm diameter.	ICRA	2008	DBLP DOI BibTeX RDF
2	Ulrich Meyer	On Trade-Offs in External-Memory Diameter-Approximation.	SWAT	2008	DBLP DOI BibTeX RDF
2	Knut-Helge Vik, Pål Halvorsen, Carsten Griwodz	Multicast Tree Diameter for Dynamic Distributed Interactive Applications.	INFOCOM	2008	DBLP DOI BibTeX RDF
2	Rui Yang, Shijie Zhou, Chengyu Fan	A New Algorithm for Network Diameter.	ICYCS	2008	DBLP DOI BibTeX RDF
2	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
2	Bin Fu, Zhiyu Zhao	Separating Sublinear Time Computations by Approximate Diameter.	COCOA	2008	DBLP DOI BibTeX RDF
2	Victor Chepoi, Feodor F. Dragan, Bertrand Estellon, Michel Habib, Yann Vaxès	Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs.	Symposium on Computational Geometry	2008	DBLP DOI BibTeX RDF	delta-hyperbolic space, diameter, center, radius
2	Jian Wang, 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
2	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
2	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	2008	DBLP DOI BibTeX RDF	DIA Jet, liquid-solid two-phase flow, the optimum ratio of diameter to length, cutting experiments, numerical simulation
2	Jianqin Zhou, Wenjuan Wang	On Constructions of Optimal Double-Loop Networks.	ICIC	2008	DBLP DOI BibTeX RDF	tight optimal, L-shaped tile, algorithm, Diameter, double-loop network
2	Elías F. Combarro, Pedro Miranda	The Polytope of Fuzzy Measures and Its Adjacency Graph.	MDAI	2008	DBLP DOI BibTeX RDF	combinatorial polytopes, diameter, Fuzzy measures, monotone boolean functions
2	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
2	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. Med. Imaging	2007	DBLP DOI BibTeX RDF
2	Robert B. Ellis, Jeremy L. Martin, Catherine H. Yan	Random Geometric Graph Diameter in the Unit Ball.	Algorithmica	2007	DBLP DOI BibTeX RDF
2	Sanjiv Kapoor, Mohammad Sarwat	Bounded-Diameter Minimum-Cost Graph Problems.	Theory Comput. Syst.	2007	DBLP DOI BibTeX RDF
2	Nguyen Duc Nghia, Huynh Thi Thanh Binh	New Recombination Operator in Genetic Algorithm For Solving the Bounded Diameter Minimum Spanning Tree Problem.	RIVF	2007	DBLP DOI BibTeX RDF
2	Rajib K. Das	Diameter and Routing in Enhanced OTIS Cube.	ICCTA	2007	DBLP DOI BibTeX RDF
2	Yusuke Sasaki, Hiroyoshi Miwa	A Control Method of a P2P Network with Small Degree and Diameter.	HIS	2007	DBLP DOI BibTeX RDF
2	Zhen Zhang, Wenjun Xiao, Mingxin He	Optimal Routing Algorithm and Diameter in Hexagonal Torus Networks.	APPT	2007	DBLP DOI BibTeX RDF
2	Maarten Löffler, Marc J. van Kreveld	Largest Bounding Box, Smallest Diameter, and Related Problems on Imprecise Points.	WADS	2007	DBLP DOI BibTeX RDF
2	Beat Gfeller, Nicola Santoro, Peter Widmayer	A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree.	DISC	2007	DBLP DOI BibTeX RDF
2	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
2	Augustin Chaintreau, Abderrahmen Mtibaa, Laurent Massoulié, Christophe Diot	The diameter of opportunistic mobile networks.	CoNEXT	2007	DBLP DOI BibTeX RDF
2	Subhash Khot, Assaf Naor	Linear Equations Modulo 2 and the L1 Diameter of Convex Bodies.	FOCS	2007	DBLP DOI BibTeX RDF
2	Shaohua Liu, Junsheng Yu, Yuan'an Liu, Jun Wei, Peng Gao, Wei Li, Jiani Ma	Make Highly Clustered Grid a Small World with Shorter Diameter.	GCC	2007	DBLP DOI BibTeX RDF
2	Jaesung Lee, Artit C. Jirapatnakul, Anthony P. Reeves, William E. Crowe, Ingrid H. Sarelius	Vessel Diameter Tracking in Intravital Microscopy Image Sequences.	ISBI	2007	DBLP DOI BibTeX RDF
2	Fragiskos Kyriakopoulos, Stefan Thurner	Directed Network Representation of Discrete Dynamical Maps.	International Conference on Computational Science	2007	DBLP DOI BibTeX RDF	network, diameter, node, dynamical maps
2	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