{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T14:06:42Z","timestamp":1761487602850,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540345978"},{"type":"electronic","value":"9783540345985"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11764298_9","type":"book-chapter","created":{"date-parts":[[2006,5,19]],"date-time":"2006-05-19T08:37:56Z","timestamp":1148027876000},"page":"98-108","source":"Crossref","is-referenced-by-count":14,"title":["Fast and Simple Approximation of the Diameter and Radius of a Graph"],"prefix":"10.1007","author":[{"given":"Krists","family":"Boitmanis","sequence":"first","affiliation":[]},{"given":"K\u0101rlis","family":"Freivalds","sequence":"additional","affiliation":[]},{"given":"P\u0113teris","family":"Ledi\u0146\u0161","sequence":"additional","affiliation":[]},{"given":"R\u016bdolfs","family":"Opmanis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"1167","DOI":"10.1137\/S0097539796303421","volume":"28","author":"D. Aingworth","year":"1999","unstructured":"Aingworth, D., Chekuri, C., Indyk, P., Motwani, R.: Fast Estimation of Diameter and Shortest Paths (without Matrix Multiplication). SIAM J. on Computing\u00a028, 1167\u20131181 (1999)","journal-title":"SIAM J. on Computing"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Di Battista, G., Garg, A., Liotta, G., Tamassia, R., Tassinari, E., Vargiu, F.: An Experimental Comparison of Three Graph Drawing Algorithms. In: Proc. 11th Annu. ACM Sympos. Comput. Geom., pp. 306\u2013315 (1995)","DOI":"10.1145\/220279.220312"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/3-540-59071-4_38","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"A. Brandst\u00e4dt","year":"1995","unstructured":"Brandst\u00e4dt, A., Chepoi, V.D., Dragan, F.F.: The Algorithmic Use of Hyper-Tree Structure and Maximum Neighborhood Orderings. In: Mayr, E.W., Schmidt, G., Tinhofer, G. (eds.) WG 1994. LNCS, vol.\u00a0903, pp. 65\u201380. Springer, Heidelberg (1995)"},{"key":"9_CR4","volume-title":"Graphs & Digraphs","author":"G. Chartrand","year":"1996","unstructured":"Chartrand, G., Lesniak, L.: Graphs & Digraphs. Chapman & Hall, Boca Raton (1996)"},{"key":"9_CR5","first-page":"295","volume":"60","author":"F.R.K. Chung","year":"1987","unstructured":"Chung, F.R.K.: Diameters of Graphs: Old Problems and New Results. Congressus Numerantium\u00a060, 295\u2013317 (1987)","journal-title":"Congressus Numerantium"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Coppersmith, D., Winograd, S.: Matrix Multiplication via Arithmetic Progression. In: Proc 19th ACM Symp on Theory of Computing, pp. 1\u20136 (1987)","DOI":"10.1145\/28395.28396"},{"key":"9_CR7","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1990","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. The MIT Press, Cambridge (1990)"},{"issue":"4","key":"9_CR8","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1002\/net.10098","volume":"42","author":"D.G. Corneil","year":"2003","unstructured":"Corneil, D.G., Dragan, F.F., K\u00f6hler, E.: On the Power of BFS to Determine a Graph\u2019s Diameter. Networks\u00a042(4), 209\u2013222 (2003)","journal-title":"Networks"},{"key":"9_CR9","unstructured":"Dor, D., Halperin, S., Zwick, U.: All Pairs Almost Shortest Paths. Electronic Colloquium on Computational Complexity\u00a04 (1997)"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1007\/3-540-58218-5_34","volume-title":"Algorithm Theory - SWAT \u201994","author":"F.F. Dragan","year":"1994","unstructured":"Dragan, F.F.: Dominating Cliques in Distance-Hereditary Graphs. In: Schmidt, E.M., Skyum, S. (eds.) SWAT 1994. LNCS, vol.\u00a0824, pp. 370\u2013381. Springer, Heidelberg (1994)"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/S0166-218X(99)00157-2","volume":"98","author":"F.F. Dragan","year":"2000","unstructured":"Dragan, F.F., Nicolai, F.: LexBFS-orderings of Distance-Hereditary Graphs with Application to the Diametral Pair Problem. Discrete Appl. Math.\u00a098, 191\u2013207 (2000)","journal-title":"Discrete Appl. Math."},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1007\/3-540-62559-3_15","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"F.F. Dragan","year":"1997","unstructured":"Dragan, F.F., Nicolai, F., Brandst\u00e4dt, A.: LexBFS-orderings and Powers of Graphs. In: D\u2019Amore, F., Marchetti-Spaccamela, A., Franciosa, P.G. (eds.) WG 1996. LNCS, vol.\u00a01197, pp. 166\u2013180. Springer, Heidelberg (1997)"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0166-218X(80)90039-6","volume":"2","author":"A.M. Farley","year":"1980","unstructured":"Farley, A.M., Proskurowsky, A.: Computation of the Center and Diameter of Outerplanar Graphs. Discrete Appl. Math.\u00a02, 185\u2013191 (1980)","journal-title":"Discrete Appl. Math."},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1287\/trsc.7.3.287","volume":"7","author":"G. Handler","year":"1973","unstructured":"Handler, G.: Minimax Location of a Facility in an Undirected Tree Graph. Transp. Sci.\u00a07, 287\u2013293 (1973)","journal-title":"Transp. Sci."},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1080\/00207169008803870","volume":"34","author":"S. Olariu","year":"1990","unstructured":"Olariu, S.: A Simple Linear-Time Algorithm for Computing the Center of an Interval Graph. Int. J. Comput. Math.\u00a034, 121\u2013128 (1990)","journal-title":"Int. J. Comput. Math."},{"key":"9_CR16","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"D. Rose","year":"1976","unstructured":"Rose, D., Tarjan, R.E., Lueker, G.: Algorithmic Aspects of Vertex Elimination on Graphs. SIAM J. Comput.\u00a05, 266\u2013283 (1976)","journal-title":"SIAM J. Comput."},{"key":"9_CR17","volume-title":"Algorithms in C, Part 5: Graph Algorithms","author":"R. Sedgewick","year":"2002","unstructured":"Sedgewick, R.: Algorithms in C, Part 5: Graph Algorithms, 3rd edn. Addison-Wesley, Reading (2002)","edition":"3"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Seidel, R.: On the All-Pair-Shortest-Paths Problem. In: Proc 24th ACM Symp. on Theory of Computing, pp. 745\u2013749 (1992)","DOI":"10.1145\/129712.129784"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11764298_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T00:50:41Z","timestamp":1736383841000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11764298_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540345978","9783540345985"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11764298_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}