Search results for "diameter"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
32	Da Wei, Yanheng Liu, Xuegang Yu, Xiaodong Li	Research of Mobile IPv6 Application Based On Diameter Protocol.	IMSCCS (2)	2006	DBLP DOI BibTeX RDF
32	Lars Arge, Ulrich Meyer 0001, Laura Toma	External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs.	ICALP	2004	DBLP DOI BibTeX RDF
32	Masahito Aoyama, Ikuo Kawashita, Yoko Naruse, Naoki Asada, Kazuo Awai	Automated Cerebral Arteries Segmentation and Diameter Measurement of Aneurysm from MR Angiograms.	KES	2003	DBLP DOI BibTeX RDF
32	Don Coppersmith, David Gamarnik, Maxim Sviridenko	The diameter of a long range percolation graph.	SODA	2002	DBLP BibTeX RDF
32	Sang Keun Yoo, Hyun Gon Kim	Analysis and Design of Secure and Reliable Transmission Protocol in Diameter.	CDMA International Conference	2002	DBLP DOI BibTeX RDF
32	Douglas W. Bass, Ivan Hal Sudborough	Symmetric k-Factorizations of Hypercubes with Factors of Small Diameter.	ISPAN	2002	DBLP DOI BibTeX RDF
32	Xiaohong W. Gao, Anil A. Bharath, Alice V. Stanton, Alun D. Hughes, Neil Chapman, Simon A. Thom	A method of vessel tracking for vessel diameter measurement on retinal images.	ICIP (2)	2001	DBLP DOI BibTeX RDF
32	Maureen Donnelly	Introducing granularity-dependent quantitativedistance and diameter measures in common-sense reasoning contexts.	FOIS	2001	DBLP DOI BibTeX RDF	spatial representation and reasoning, measurement, granularity, common-sense reasoning
32	Ting-Yi Sung, Jeng-Jung Wang	Changing the Diameter of Graph Products.	COCOON	2001	DBLP DOI BibTeX RDF
32	Geert J. Streekstra, Rein van den Boomgaard, Arnold W. M. Smeulders	Scale Dependent Differential Geometry for the Measurement of Center Line and Diameter in 3D Curvilinear Structures.	ECCV (1)	2000	DBLP DOI BibTeX RDF
32	Derek G. Corneil, Feodor F. Dragan, Michel Habib, Christophe Paul	Diameter Determination on Restricted Graph Faminlies.	WG	1998	DBLP DOI BibTeX RDF
32	Sven Schuierer	Computing the L1-Diameter and Center of a Simple Rectilinear Polygon in Parallel.	SWAT	1994	DBLP DOI BibTeX RDF
32	Anneke A. Schoone, Hans L. Bodlaender, Jan van Leeuwen	Improved Diameter Bounds for Altered Graphs.	WG	1986	DBLP DOI BibTeX RDF
29	Debasish Das, Mallika De, Bhabani P. Sinha	A New Network Topology with Multiple Meshes.	IEEE Trans. Computers	1999	DBLP DOI BibTeX RDF	multimesh, Lagrange's interpolation, multicast, Mesh, DFT, matrix multiplication, diameter, Hamiltonian cycle, one-to-all broadcast, point-to-point communication, fault-diameter, matrix transpose
28	Tjerk de Greef, Harmen Lafeber, Herre van Oostendorp, Jasper Lindenberg	Eye Movement as Indicators of Mental Workload to Trigger Adaptive Automation.	HCI (16)	2009	DBLP DOI BibTeX RDF	pupil diameter, fixation time, eye movement, saccade, mental workload, adaptive automation
28	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
28	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
28	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
28	Diego D. B. Carvalho, Thiago R. dos Santos, Aldo von Wangenheim	Measuring Arterial Diameters for Surgery Assistance, Patient Customized Endovascular Prosthesis Design and Post-Surgery Evaluation.	CBMS	2006	DBLP DOI BibTeX RDF	arterial diameter measurement, endovascular prosthesis, endoluminal prosthesis, DLFL
28	Hsien-Jone Hsieh, Dyi-Rong Duh	Constructing Node-Disjoint Paths in Enhanced Pyramid Networks.	Asia-Pacific Computer Systems Architecture Conference	2006	DBLP DOI BibTeX RDF	Enhanced pyramid networks, pyramid networks, fault-tolerance, interconnection networks, container, node-disjoint paths, wide diameter
28	Honghui Hu, Naijie Gu, Jing Cao	A Note on Recursive Cube of Rings Network.	IEEE Trans. Parallel Distributed Syst.	2005	DBLP DOI BibTeX RDF	Recursive Cube of Rings (RCR), disconnected graph, network diameter, bisection width
28	Satoru Watanabe, Satoshi Okawa	An Extended Star Graph: A Proposal of a New Network Topology and Its Fundamental Properties.	ISPA	2003	DBLP DOI BibTeX RDF	degree four Cayley graphs, hy- percubes, routing algorithm, diameter, Cayley graphs, star graphs
28	Vijay Lakamraju, Israel Koren, C. Mani Krishna 0001	Filtering Random Graphs to Synthesize Interconnection Networks with Multiple Objectives.	IEEE Trans. Parallel Distributed Syst.	2002	DBLP DOI BibTeX RDF	fault tolerance, Interconnection networks, synthesis, filters, embedding, diameter, packaging, random regular graphs
28	Marissa P. Justan, Felix P. Muga II, Ivan Hal Sudborough	On the Generalization of the Pancake Network.	ISPAN	2002	DBLP DOI BibTeX RDF	wreath product, diameter of a graph, Cayley graphs, Pancake graphs
28	Vijay Lakamraju, Zahava Koren, C. Mani Krishna 0001	Synthesis of Interconnection Networks: A Novel Approach.	DSN	2000	DBLP DOI BibTeX RDF	low diameter, fault tolerance, scalability, Interconnection networks, filtering, random regular graphs
28	Jin-yi Cai, George Havas, Bernard Mans, Ajay Nerurkar, Jean-Pierre Seifert, Igor E. Shparlinski	On Routing in Circulant Graphs.	COCOON	1999	DBLP DOI BibTeX RDF	Shortest paths, Lattices, Diameter, Loops, Circulant graphs
28	Arunita Jaekel, Subir Bandyopadhyay, Abhijit Sengupta	A Flexible Architecture for Multi-Hop Optical Networks.	ICCCN	1998	DBLP DOI BibTeX RDF	scalable logical topology, low diameter networks, optical networks, multihop networks
28	Raymond C. Chan, William Clement Karl, Robert S. Lees	Quality enhancement of arterial measurements based on a more accurate stochastic model of X-ray cine-angiography.	ICIP (3)	1997	DBLP DOI BibTeX RDF	arterial measurements, accurate stochastic model, X-ray cine-angiography, quality enhancement, narrow coronary arteries, low measurement error, image model parameters, angiographic data, diameter estimation quality, X-ray image data, coronary disease, narrow vessel widths, performance, parameter estimation, sensitivity, Monte Carlo simulation, parametric model, diagnostic radiography, image intensity
28	Daniela Ferrero, Carles Padró	Fault-Tolerant Routings in Large Generalized Cycles.	SCCC	1997	DBLP DOI BibTeX RDF	fault-tolerant routing algorithms, de Bruijn generalized cycles, Kautz generalized cycles, generalized p-cycle, vertex set partitioning, faulty elements, directed graphs, diameter, digraph, ordered set, path length
28	Yupin Luo, Shiyuan Yang, Dongcheng Hu	Constructing an Edge-Route Guaranteed Optimal Fault-Tolerant Routing for Biconnected Graphs.	Asian Test Symposium	1996	DBLP DOI BibTeX RDF	Fault tolerance, Routing, Network, Distributed computing, Diameter
28	Noga Alon, Erik D. Demaine, MohammadTaghi Hajiaghayi, Tom Leighton	Basic network creation games.	SPAA	2010	DBLP DOI BibTeX RDF	routing, nash equilibrium, network design, price of anarchy
28	Donghyun Kim 0001, Yiwei Wu, Yingshu Li, Feng Zou, Ding-Zhu Du	Constructing Minimum Connected Dominating Sets with Bounded Diameters in Wireless Networks.	IEEE Trans. Parallel Distributed Syst.	2009	DBLP DOI BibTeX RDF
28	Hamid R. Arabnia	A Scalable Network Topology for Medical Imaging.	HPCC	2008	DBLP DOI BibTeX RDF
28	Deke Guo, Yunhao Liu 0001, Xiang-Yang Li 0001	BAKE: A Balanced Kautz Tree Structure for Peer-to-Peer Networks.	INFOCOM	2008	DBLP DOI BibTeX RDF
28	Isaac Elias, Tzvika Hartman	A 1.375-Approximation Algorithm for Sorting by Transpositions.	IEEE ACM Trans. Comput. Biol. Bioinform.	2006	DBLP DOI BibTeX RDF	sorting permutations by transpositions, Computational biology, genome rearrangements
28	Rajib K. Das	Enhanced OTIS k-Ary n-Cube Networks.	ICDCIT	2006	DBLP DOI BibTeX RDF
28	Zhenyu Liu, Dimitrios A. Pados	LDPC codes from generalized polygons.	IEEE Trans. Inf. Theory	2005	DBLP DOI BibTeX RDF
28	Domenico Cantone, Alfredo Ferro, Rosalba Giugno, Giuseppe Lo Presti, Alfredo Pulvirenti	Multiple-Winners Randomized Tournaments with Consensus for Optimization Problems in Generic Metric Spaces.	WEA	2005	DBLP DOI BibTeX RDF
28	Michele Flammini, Luca Moscardelli, Alfredo Navarra, Stéphane Pérennes	Asymptotically Optimal Solutions for Small World Graphs.	DISC	2005	DBLP DOI BibTeX RDF
28	Isaac Elias, Tzvika Hartman	A 1.375-Approximation Algorithm for Sorting by Transpositions.	WABI	2005	DBLP DOI BibTeX RDF
28	Michael L. Oelze, William D. O'Brien Jr., James P. Blue, James F. Zachary	Differentiation and characterization of rat mammary fibroadenomas and 4T1 mouse carcinomas using quantitative ultrasound imaging.	IEEE Trans. Medical Imaging	2004	DBLP DOI BibTeX RDF
28	Wei-Mei Chen, Gen-Huey Chen, D. Frank Hsu	Generalized Diameters of the Mesh of Trees.	Theory Comput. Syst.	2004	DBLP DOI BibTeX RDF
28	Kishori M. Konwar, Dariusz R. Kowalski, Alexander A. Shvartsman	The Join Problem in Dynamic Network Algorithms.	DSN	2004	DBLP DOI BibTeX RDF
28	Mário M. Freire, Joel J. P. C. Rodrigues, Rui M. F. Coelho	The Role of Network Topologies in the Optical Core of IP-over-WDM Networks with Static Wavelength Routing.	Telecommun. Syst.	2003	DBLP DOI BibTeX RDF	optical Internet, routing, network topologies, optical networks
28	Rinovia Simanjuntak, Mirka Miller	Maximum Order of Planar Digraphs.	IJCCGGT	2003	DBLP DOI BibTeX RDF
28	Rui M. F. Coelho, Joel J. P. C. Rodrigues, Mário M. Freire	Performance Analysis of Degree Four Topologies for the Optical Core of IP-over-WDM Networks.	ICOIN	2003	DBLP DOI BibTeX RDF
28	Dariusz R. Kowalski, Andrzej Pelc	Deterministic Broadcasting Time in Radio Networks of Unknown Topology.	FOCS	2002	DBLP DOI BibTeX RDF
28	Leszek Gasieniec, Jesper Jansson 0001, Andrzej Lingas	Approximation Algorithms for Hamming Clustering Problems.	CPM	2000	DBLP DOI BibTeX RDF
28	Wei-Mei Chen, Gen-Huey Chen, D. Frank Hsu	Combinatorial Properties of Mesh of Trees.	ISPAN	2000	DBLP DOI BibTeX RDF
28	Ivan Stojmenovic	Honeycomb Networks: Topological Properties and Communication Algorithms.	IEEE Trans. Parallel Distributed Syst.	1997	DBLP DOI BibTeX RDF	hexagonal tessellation, routing, broadcasting, Computer architecture, mesh-connected computer, interconnection topology
28	Ivan Stojmenovic	Honecomb Networks.	MFCS	1995	DBLP DOI BibTeX RDF
28	Michael J. Dinneen, Michael R. Fellows, Vance Faber	Algebraic Constructions of Efficient Broadcast Networks.	AAECC	1991	DBLP DOI BibTeX RDF
28	Kenneth L. Clarkson, Peter W. Shor	Algorithms for Diametral Pairs and Convex Hulls That Are Optimal, Randomized, and Incremental.	SCG	1988	DBLP DOI BibTeX RDF
26	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
26	Cheng-Kuan Lin, Hua-Min Huang, D. Frank Hsu, Lih-Hsing Hsu	The Spanning Diameter of the Star Graphs.	ISPAN	2004	DBLP DOI BibTeX RDF	hamiltonian laceable, diameter, star graphs, hamiltonian
26	Wen-Zhan Song 0001, Xiang-Yang Li 0001, Yu Wang 0003, Weizhao Wang	dBBlue: low diameter and self-routing bluetooth scatternet.	DIALM-POMC	2003	DBLP DOI BibTeX RDF	bluetooth networks, low diameter, scalable MAC assignment, single-hop, self-routing, de Bruijn graph, scatternet formation
26	Aaron Harwood, Hong Shen 0001	A Method of Trading Diameter for Reduced Degree to Construct Low Cost Interconnection Networks.	SAC	1999	DBLP DOI BibTeX RDF	interconnection network, cost, diameter, degree
26	Heinrich Braun, Frank Stephan 0001	On Optimizing Diameter and Average Distance of Directed Interconnected Networks.	IEEE Trans. Computers	1993	DBLP DOI BibTeX RDF	Maekawa problem, directed interconnected networks, logarithmic time complexity, computational complexity, multiprocessor interconnection networks, directed graphs, routing algorithms, diameter, buffer size, minimisation of switching nets, average distance
26	László Lovász 0001, Miklós Simonovits	On the Randomized Complexity of Volume and Diameter	FOCS	1992	DBLP DOI BibTeX RDF	unit ball, randomized complexity, mixing rate, Markov chains, random walks, diameter, volume, convex polytopes, convex body
26	Sorin Istrail	Constructing Generalized Universal Traversing Sequences of Polynomial Size for Graphs with Small Diameter (Extended Abstract)	FOCS	1990	DBLP DOI BibTeX RDF	polynomial-size, generalized universal traversing sequences, polynomial size for graphs, small diameter, labeled undirected graphs, edge labels, derandomizations, finite automaton, space-bounded computation
26	Bhabani P. Sinha, Bhargab B. Bhattacharya, Suranjan Ghose, Pradip K. Srimani	A Parallel Algorithm to Compute the Shortest Paths and Diameter of a Graph and Its VLSI Implementation.	IEEE Trans. Computers	1986	DBLP DOI BibTeX RDF	parallel algorithms, pipelining, shortest paths, VLSI architecture, Diameter
26	Makoto Imase, Masaki Itoh	A Design for Directed Graphs with Minimum Diameter.	IEEE Trans. Computers	1983	DBLP DOI BibTeX RDF	diameter minimization, optimum solution, Computer networks, directed graphs, switching systems
26	Makoto Imase, Masaki Itoh	Design to Minimize Diameter on Building-Block Network.	IEEE Trans. Computers	1981	DBLP DOI BibTeX RDF	diameter minimization, nearly optimum solution, lower bounds, distance, Building-block, undirected graph, switching system
26	Sam Toueg, Kenneth Steiglitz	The Design of Small-Diameter Networks by Local Search.	IEEE Trans. Computers	1979	DBLP DOI BibTeX RDF	networks, delay, graphs, Communication networks, diameter
25	Yi Xu, Yu Du, Bo Zhao 0007, Xiuyi Zhou, Youtao Zhang, Jun Yang 0002	A low-radix and low-diameter 3D interconnection network design.	HPCA	2009	DBLP DOI BibTeX RDF
25	Friedrich Eisenbrand, Nicolai Hähnle, Thomas Rothvoß	Diameter of polyhedra: limits of abstraction.	SCG	2009	DBLP DOI BibTeX RDF	disjoint coverings, hirsch conjecture, polyhedra, convex geometry
25	Rajeev Kumar, Bipul Kumar Bal, Peter I. 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
25	Lior Shapira, Ariel Shamir, Daniel Cohen-Or	Consistent mesh partitioning and skeletonisation using the shape diameter function.	Vis. Comput.	2008	DBLP DOI BibTeX RDF	Geometry processing, Skeleton extraction, Mesh decomposition
25	Beat Gfeller	Faster Swap Edge Computation in Minimum Diameter Spanning Trees.	ESA	2008	DBLP DOI BibTeX RDF
25	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
25	Robert B. Ellis, Jeremy L. Martin, Catherine H. Yan	Random Geometric Graph Diameter in the Unit Ball.	Algorithmica	2007	DBLP DOI BibTeX RDF
25	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
25	Sergey G. Molodtsov	Largest Graphs of Diameter 2 and Maximum Degree 6.	GTIT-C	2006	DBLP DOI BibTeX RDF
25	Yanhua Wu, Yunze Cai, Jinjie Huang, Xiaoming Xu	Minimum Diameter Application Layer Multicast Tree Algorithm.	IMSCCS (1)	2006	DBLP DOI BibTeX RDF
25	Qiang Ding, Ke Xu 0002, Hui-shan Liu	Construct Optimal Diameter Network and d-partition Routing Algorithm.	ISPA Workshops	2005	DBLP DOI BibTeX RDF
25	S. Veeravalli, Laxmi P. Gewali, Muthukumar Venkatesan	Construction of Power-Aware Diameter-Reduced Broadcast Trees.	ITCC (2)	2005	DBLP DOI BibTeX RDF
25	Béla Bollobás, Oliver Riordan	The Diameter of a Scale-Free Random Graph.	Comb.	2004	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C80
25	Erik D. Demaine, Mohammad Taghi Hajiaghayi	Diameter and Treewidth in Minor-Closed Graph Families, Revisited.	Algorithmica	2004	DBLP DOI BibTeX RDF	Apex graphs, Bounded local treewidth, Approximation algorithms, Graph algorithms, Graph minors
25	Andréa C. dos Santos, Abilio Lucena, Celso C. Ribeiro	Solving Diameter Constrained Minimum Spanning Tree Problems in Dense Graphs.	WEA	2004	DBLP DOI BibTeX RDF
25	Walter G. Kropatsch, Yll Haxhimusa, Zygmunt Pizlo	Integral Trees: Subtree Depth and Diameter.	IWCIA	2004	DBLP DOI BibTeX RDF
25	Shin-Ichi Nakano, Takeaki Uno	Constant Time Generation of Trees with Specified Diameter.	WG	2004	DBLP DOI BibTeX RDF
25	Xinmin Hou, Bolian Liu, Tianming Wang	An Algorithm to Construct k-Regular k-Connected Graphs with the Maximum k-Diameter.	Graphs Comb.	2003	DBLP DOI BibTeX RDF
25	Abhishek Kumar 0003, Shashidhar Merugu, Jun (Jim) Xu, Xingxing Yu	Ulysses: A Robust, Low-Diameter, Low-Latency Peer-ti-Peer Network.	ICNP	2003	DBLP DOI BibTeX RDF
25	Byung Gil Lee, Hyun Gon Kim, Sung Won Sohn, Kil-Houm Park	Design of an Accounting Architecture for Load and Session Managed Diameter-Based AAA Network.	CDMA International Conference	2002	DBLP DOI BibTeX RDF
25	Grégoire Malandain, Jean-Daniel Boissonnat	Computing the Diameter of a Point Set.	DGCI	2002	DBLP DOI BibTeX RDF
25	Joachim Gudmundsson, Herman J. Haverkort, Sang-Min Park, Chan-Su Shin, Alexander Wolff 0001	Facility Location and the Geometric Minimum-Diameter Spanning Tree.	APPROX	2002	DBLP DOI BibTeX RDF
25	Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler	On the Power of BFS to Determine a Graphs Diameter.	LATIN	2002	DBLP DOI BibTeX RDF
25	Jaime D. L. Caro, Tedros Weldemicael Zeratsion	On the Diameter of a Class of the Generalized de Bruijn Graphs.	ISPAN	2002	DBLP DOI BibTeX RDF
25	Edgar A. Ramos	An Optimal Deterministic Algorithm for Computing the Diameter of a Three-Dimensional Point Set.	Discret. Comput. Geom.	2001	DBLP DOI BibTeX RDF
25	David Eppstein	Diameter and Treewidth in Minor-Closed Graph Families.	Algorithmica	2000	DBLP DOI BibTeX RDF
25	Narsingh Deo, Ayman M. Abdalla	Computing a Diameter-Constrained Minimum Spanning Tree in Parallel.	CIAC	2000	DBLP DOI BibTeX RDF
25	Geert J. Streekstra, Arnold W. M. Smeulders, Rein van den Boomgaard	Tracing of Curvilinear Structures in 3D Images with Single Scale Diameter Measurement.	Scale-Space	1999	DBLP DOI BibTeX RDF
25	Enrico Nardelli, Guido Proietti, Peter Widmayer	Finding All the Best Swaps of a Minimum Diameter Spanning Tree under Transient Edge Failures.	ESA	1998	DBLP DOI BibTeX RDF
25	Hans L. Bodlaender, Torben Hagerup	Tree Decompositions of Small Diameter.	MFCS	1998	DBLP DOI BibTeX RDF
25	Claus-Peter Schnorr, C. R. Subramanian 0001	Almost Optimal (on the average) Combinatorial Algorithms for Boolean Matrix Product Witnesses, Computing the Diameter (Extended Abstract).	RANDOM	1998	DBLP DOI BibTeX RDF
25	Michael Sampels	Large Networks with Small Diameter.	WG	1997	DBLP DOI BibTeX RDF
25	Franck Butelle, Christian Lavault, Marc Bui	A Uniform Self-Stabilizing Minimum Diameter Tree Algorithm (Extended Abstract).	WDAG	1995	DBLP DOI BibTeX RDF
25	Koichi Wada 0001, Takaharu Ikeo, Kimio Kawaguchi, Wei Chen 0003	Highly Fault-Tolerant Routings and Diameter Vulnerability for Generalized Hypercube Graphs.	WG	1995	DBLP DOI BibTeX RDF
23	Nariman Niknejad, Rafael Bidese-Puhl, Yin Bao, Kitt G. Payn, Jingyi Zheng	Phenotyping of architecture traits of loblolly pine trees using stereo machine vision and deep learning: Stem diameter, branch angle, and branch diameter.	Comput. Electron. Agric.	2023	DBLP DOI BibTeX RDF
23	Xiaolin Wang, Yaojun Chen	Optimal oriented diameter of graphs with diameter 3.	J. Comb. Theory, Ser. B	2022	DBLP DOI BibTeX RDF