{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,26]],"date-time":"2024-03-26T15:10:29Z","timestamp":1711465829071},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,7,1]],"date-time":"1994-07-01T00:00:00Z","timestamp":773020800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6956,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1994,7]]},"DOI":"10.1016\/0166-218x(94)90154-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"17-28","source":"Crossref","is-referenced-by-count":7,"title":["Faster isometric embedding in products of complete graphs"],"prefix":"10.1016","volume":"52","author":[{"given":"Franz","family":"Aurenhammer","sequence":"first","affiliation":[]},{"given":"Michael","family":"Formann","sequence":"additional","affiliation":[]},{"given":"Ramana M.","family":"Idury","sequence":"additional","affiliation":[]},{"given":"Alejandro A.","family":"Sch\u00e4ffer","sequence":"additional","affiliation":[]},{"given":"Frank","family":"Wagner","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(94)90154-6_BIB1","first-page":"569","article-title":"On the exponent of the all pairs shortest path problem","author":"Alon","year":"1991","journal-title":"Proceedings 32nd Annual IEEE Symposium on Foundations of Computer Science"},{"key":"10.1016\/0166-218X(94)90154-6_BIB2","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1007\/3-540-53832-1_34","article-title":"Recognizing binary Hamming graphs in O(n2logn) time","volume":"484","author":"Aurenhammer","year":"1990","journal-title":"Proceedings 16th International Workshop on Graph-Theoretical Concepts in Computer Science"},{"key":"10.1016\/0166-218X(94)90154-6_BIB3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0012-365X(92)90274-J","article-title":"Computing equivalence classes among the edges of a graph with tiapplications","volume":"110","author":"Aurenhammer","year":"1992","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(94)90154-6_BIB4","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1002\/jgt.3190080407","article-title":"Retracts of hypercubes","volume":"8","author":"Bandelt","year":"1984","journal-title":"J. Graph Theory"},{"key":"10.1016\/0166-218X(94)90154-6_BIB5","unstructured":"P.K. Jha and G. Slutzki, An O(n2logn) algorithm for recognizing median graphs, submitted."},{"key":"10.1016\/0166-218X(94)90154-6_BIB6","first-page":"75","article-title":"Convex-expansion algorithms for recognition and isometric embedding of median graphs","volume":"34","author":"Jha","year":"1992","journal-title":"Ars Combin."},{"key":"10.1016\/0166-218X(94)90154-6_BIB7","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1109\/SFCS.1991.185419","article-title":"Finding the hidden path: Time bounds for all-pairs shortest paths","author":"Karger","year":"1991","journal-title":"Proceedings 32nd Annual IEEE Symposium on Foundations of Computer Science"},{"key":"10.1016\/0166-218X(94)90154-6_BIB8","first-page":"745","article-title":"On the all-pairs shortest path problem","author":"Seidel","year":"1992","journal-title":"Proceedings 24th Annual ACM Symposium on Theory of Computing"},{"key":"10.1016\/0166-218X(94)90154-6_BIB9","series-title":"Data Structures and Network Algorithms","author":"Tarjan","year":"1983"},{"key":"10.1016\/0166-218X(94)90154-6_BIB10","first-page":"12","article-title":"Finding biconnected components and computing tree functions in logarithmic time","author":"Tarjan","year":"1984","journal-title":"Proceedings 25th Annual IEEE Symposium on Foundations of Computer Science"},{"key":"10.1016\/0166-218X(94)90154-6_BIB11","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0095-8956(90)90073-9","article-title":"Isometric embeddings in Hamming graphs","volume":"50","author":"Wilkeit","year":"1990","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/0166-218X(94)90154-6_BIB12","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0166-218X(84)90069-6","article-title":"Isometric embeddings in products of complete graphs","volume":"7","author":"Winkler","year":"1984","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(94)90154-6_BIB13","series-title":"Surveys in Combinatorics","first-page":"197","article-title":"The metric structure of graphs: Theory and applications","volume":"123","author":"Winkler","year":"1988"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94901546?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94901546?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:27:57Z","timestamp":1555136877000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X94901546"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,7]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,7]]}},"alternative-id":["0166218X94901546"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(94)90154-6","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1994,7]]}}}