The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for Diameter with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1960-1979 (16) 1980-1982 (16) 1983-1984 (21) 1985-1986 (17) 1987-1988 (24) 1989 (20) 1990 (25) 1991 (35) 1992 (41) 1993 (41) 1994 (49) 1995 (48) 1996 (43) 1997 (64) 1998 (55) 1999 (60) 2000 (63) 2001 (80) 2002 (99) 2003 (103) 2004 (180) 2005 (168) 2006 (168) 2007 (192) 2008 (223) 2009 (169) 2010 (110) 2011 (99) 2012 (113) 2013 (105) 2014 (104) 2015 (109) 2016 (117) 2017 (128) 2018 (143) 2019 (148) 2020 (123) 2021 (144) 2022 (164) 2023 (136) 2024 (38)
Publication types (Num. hits)
article(2053) data(2) incollection(10) inproceedings(1734) phdthesis(2)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 1883 occurrences of 932 keywords

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