{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T07:10:29Z","timestamp":1726384229351},"reference-count":23,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3643,"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":[[2003,9]]},"DOI":"10.1016\/s0166-218x(02)00416-x","type":"journal-article","created":{"date-parts":[[2003,2,12]],"date-time":"2003-02-12T01:10:51Z","timestamp":1045012251000},"page":"51-61","source":"Crossref","is-referenced-by-count":9,"title":["Fast recognition algorithms for classes of partial cubes"],"prefix":"10.1016","volume":"131","author":[{"given":"Bo\u0161tjan","family":"Bre\u0161ar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wilfried","family":"Imrich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandi","family":"Klav\u017ear","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(02)00416-X_BIB1","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/BF01185863","article-title":"Recognizing binary Hamming graphs in O(n2logn) time","volume":"28","author":"Aurenhammer","year":"1995","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0166-218X(02)00416-X_BIB2","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1006\/eujc.1996.0010","article-title":"Graphs of acyclic cubical complexes","volume":"17","author":"Bandelt","year":"1996","journal-title":"Eur. J. Combin."},{"key":"10.1016\/S0166-218X(02)00416-X_BIB3","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1002\/jgt.3190180705","article-title":"Quasi-median graphs and algebras","volume":"18","author":"Bandelt","year":"1994","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0166-218X(02)00416-X_BIB4","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1002\/jgt.10031","article-title":"Tiled partial cubes","volume":"40","author":"Bre\u0161ar","year":"2002","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0166-218X(02)00416-X_BIB5","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/BF01069520","article-title":"d-Convexity and isometric subgraphs of Hamming graphs","volume":"1","author":"Chepoi","year":"1988","journal-title":"Cybernetics"},{"key":"10.1016\/S0166-218X(02)00416-X_BIB6","unstructured":"V. Chepoi, Personal communication, September 1999."},{"key":"10.1016\/S0166-218X(02)00416-X_BIB7","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1137\/0214017","article-title":"Arboricity and subgraph listing algorithms","volume":"14","author":"Chiba","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(02)00416-X_BIB8","series-title":"Introduction to Algorithms","author":"Cormen","year":"1990"},{"key":"10.1016\/S0166-218X(02)00416-X_BIB9","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0095-8956(73)90010-5","article-title":"Distance preserving subgraphs of hypercubes","volume":"14","author":"Djokovi\u0107","year":"1973","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0166-218X(02)00416-X_BIB10","doi-asserted-by":"crossref","first-page":"2495","DOI":"10.1002\/j.1538-7305.1971.tb02618.x","article-title":"On the addressing problem for loop switching","volume":"50","author":"Graham","year":"1971","journal-title":"Bell System Technol. J."},{"key":"10.1016\/S0166-218X(02)00416-X_BIB11","doi-asserted-by":"crossref","unstructured":"R. Graham, H. Pollak, On embedding graphs in squashed cubes, in: Graph Theory and Applications, Lecture Notes in Mathematics, Vol. 303, Springer, New York, 1972, pp. 99\u2013110.","DOI":"10.1007\/BFb0067362"},{"key":"10.1016\/S0166-218X(02)00416-X_BIB12","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0304-3975(97)00136-9","article-title":"Recognizing median graphs in subquadratic time","volume":"215","author":"Hagauer","year":"1999","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0166-218X(02)00416-X_BIB13","first-page":"45","article-title":"A simple O(mn) algorithm for recognizing Hamming graphs","volume":"9","author":"Imrich","year":"1993","journal-title":"Bull. Inst. Combin. Appl."},{"key":"10.1016\/S0166-218X(02)00416-X_BIB14","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1006\/eujc.1998.0229","article-title":"A convexity lemma and expansion procedures for bipartite graphs","volume":"19","author":"Imrich","year":"1998","journal-title":"Eur. J. Combin."},{"key":"10.1016\/S0166-218X(02)00416-X_BIB15","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/S0166-218X(99)00084-0","article-title":"Recognizing graphs of acyclic cubical complexes","volume":"95","author":"Imrich","year":"1999","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(02)00416-X_BIB16","series-title":"Product Graphs: Structure and Recognition","author":"Imrich","year":"2000"},{"key":"10.1016\/S0166-218X(02)00416-X_BIB17","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1137\/S0895480197323494","article-title":"Median graphs and triangle-free graphs","volume":"12","author":"Imrich","year":"1999","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(02)00416-X_BIB18","first-page":"75","article-title":"Convex-expansion algorithms for recognizing and isometric embedding of median graphs","volume":"34","author":"Jha","year":"1992","journal-title":"Ars Combin."},{"key":"10.1016\/S0166-218X(02)00416-X_BIB19","first-page":"103","article-title":"Median graphs","volume":"30","author":"Klav\u017ear","year":"1999","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"10.1016\/S0166-218X(02)00416-X_BIB20","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0012-365X(78)90199-1","article-title":"The structure of median graphs","volume":"24","author":"Mulder","year":"1978","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(02)00416-X_BIB21","unstructured":"H.M. Mulder, The Interval Function of a Graph, Mathematical Centre Tracts 132, Mathematisch Centrum, Amsterdam, 1980."},{"key":"10.1016\/S0166-218X(02)00416-X_BIB22","series-title":"Contemporary Methods in Graph Theory","first-page":"459","article-title":"The expansion procedure for graphs","author":"Mulder","year":"1990"},{"key":"10.1016\/S0166-218X(02)00416-X_BIB23","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."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X0200416X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X0200416X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,28]],"date-time":"2019-03-28T16:23:39Z","timestamp":1553790219000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X0200416X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0166218X0200416X"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00416-x","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}