{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T15:58:35Z","timestamp":1774367915219,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,6,13]],"date-time":"2008-06-13T00:00:00Z","timestamp":1213315200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1007\/s00453-008-9200-4","type":"journal-article","created":{"date-parts":[[2008,6,12]],"date-time":"2008-06-12T17:26:10Z","timestamp":1213291570000},"page":"207-216","source":"Crossref","is-referenced-by-count":9,"title":["Computing median and antimedian sets in median graphs"],"prefix":"10.1007","volume":"57","author":[{"given":"Kannan","family":"Balakrishnan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo\u0161tjan","family":"Bre\u0161ar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manoj","family":"Changat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandi","family":"Klav\u017ear","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matja\u017e","family":"Kov\u0161e","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ajitha R.","family":"Subhamathi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,6,13]]},"reference":[{"key":"9200_CR1","unstructured":"Balakrishnan, K.: Algorithms for median computation in median graphs and their generalizations using consensus strategies. Ph.D. Thesis, University of Kerala (2006)"},{"key":"9200_CR2","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1002\/jgt.3190080407","volume":"8","author":"H.-J. Bandelt","year":"1984","unstructured":"Bandelt, H.-J.: Retracts of hypercubes. J. Graph Theory 8, 501\u2013510 (1984)","journal-title":"J. Graph Theory"},{"key":"9200_CR3","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0166-218X(84)90096-9","volume":"8","author":"H.-J. Bandelt","year":"1984","unstructured":"Bandelt, H.-J., Barth\u00e9lemy, J.-P.: Medians in median graphs. Discrete Appl. Math. 8, 131\u2013142 (1984)","journal-title":"Discrete Appl. Math."},{"key":"9200_CR4","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1137\/S089548019936360X","volume":"15","author":"H.-J. Bandelt","year":"2002","unstructured":"Bandelt, H.-J., Chepoi, V.: Graphs with connected medians. SIAM J. Discrete Math. 15, 268\u2013282 (2002)","journal-title":"SIAM J. Discrete Math."},{"key":"9200_CR5","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1002\/jgt.3190180705","volume":"18","author":"H.-J. Bandelt","year":"1994","unstructured":"Bandelt, H.-J., Mulder, H.M., Wilkeit, E.: Quasi-median graphs and algebras. J. Graph Theory 18, 681\u2013703 (1994)","journal-title":"J. Graph Theory"},{"key":"9200_CR6","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0165-4896(81)90041-X","volume":"1","author":"J.-P. Barth\u00e9lemy","year":"1980\u20131981","unstructured":"Barth\u00e9lemy, J.-P., Monjardet, B.: The median procedure in cluster analysis and social choice theory. Math. Social Sci. 1, 235\u2013267 (1980\u20131981)","journal-title":"Math. Social Sci."},{"key":"9200_CR7","first-page":"269","volume":"18","author":"H. Bielak","year":"1983","unstructured":"Bielak, H., Syslo, M.M.: Peripheral vertices in graphs. Stud. Sci. Math. Hung. 18, 269\u2013275 (1983)","journal-title":"Stud. Sci. Math. Hung."},{"key":"9200_CR8","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/S0166-218X(02)00416-X","volume":"131","author":"B. Bre\u0161ar","year":"2003","unstructured":"Bre\u0161ar, B., Imrich, W., Klav\u017ear, S.: Fast recognition algorithms for classes of partial cubes. Discrete Appl. Math. 131, 51\u201361 (2003)","journal-title":"Discrete Appl. Math."},{"key":"9200_CR9","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0166-218X(03)00431-1","volume":"133","author":"P. Cappanera","year":"2003","unstructured":"Cappanera, P., Gallo, G., Maffioli, F.: Discrete facility location and routing of obnoxious activities. Discrete Appl. Math. 133, 3\u201328 (2003)","journal-title":"Discrete Appl. Math."},{"key":"9200_CR10","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1137\/0214017","volume":"14","author":"N. Chiba","year":"1985","unstructured":"Chiba, N., Nishizeki, T.: Arboricity and subgraph listing algorithms. SIAM J. Comput. 14, 210\u2013223 (1985)","journal-title":"SIAM J. Comput."},{"key":"9200_CR11","first-page":"555","volume":"116","author":"T. Feder","year":"1995","unstructured":"Feder, T.: Stable networks and product graphs. Mem. Am. Math. Soc. 116, 555 (1995)","journal-title":"Mem. Am. Math. Soc."},{"key":"9200_CR12","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0304-3975(97)00136-9","volume":"215","author":"J. Hagauer","year":"1999","unstructured":"Hagauer, J., Imrich, W., Klav\u017ear, S.: Recognizing median graphs in subquadratic time. Theor. Comput. Sci. 215, 123\u2013136 (1999)","journal-title":"Theor. Comput. Sci."},{"key":"9200_CR13","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/S0166-218X(99)00084-0","volume":"95","author":"W. Imrich","year":"1999","unstructured":"Imrich, W., Klav\u017ear, S.: Recognizing graphs of acyclic cubical complexes. Discrete Appl. Math. 95, 321\u2013330 (1999)","journal-title":"Discrete Appl. Math."},{"key":"9200_CR14","volume-title":"Product Graphs: Structure and Recognition","author":"W. Imrich","year":"2000","unstructured":"Imrich, W., Klav\u017ear, S.: Product Graphs: Structure and Recognition. Wiley\u2013Interscience, New York (2000)"},{"key":"9200_CR15","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1137\/S0895480197323494","volume":"12","author":"W. Imrich","year":"1999","unstructured":"Imrich, W., Klav\u017ear, S., Mulder, H.M.: Median graphs and triangle-free graphs. SIAM J. Discrete Math. 12, 111\u2013118 (1999)","journal-title":"SIAM J. Discrete Math."},{"key":"9200_CR16","first-page":"103","volume":"30","author":"S. Klav\u017ear","year":"1999","unstructured":"Klav\u017ear, S., Mulder, H.M.: Median graphs: characterizations, location theory and related structures. J. Comb. Math. Comb. Comput. 30, 103\u2013127 (1999)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"9200_CR17","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/S0166-218X(02)00211-1","volume":"127","author":"B. Leclerc","year":"2003","unstructured":"Leclerc, B.: The median procedure in the semilattice of orders. Discrete Appl. Math. 127, 285\u2013302 (2003)","journal-title":"Discrete Appl. Math."},{"key":"9200_CR18","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0166-218X(98)00003-1","volume":"84","author":"F.R. McMorris","year":"1998","unstructured":"McMorris, F.R., Mulder, H.M., Roberts, F.R.: The median procedure on median graphs. Discrete Appl. Math. 84, 165\u2013181 (1998)","journal-title":"Discrete Appl. Math."},{"key":"9200_CR19","series-title":"Math. Centre Tracts, vol.\u00a0132","volume-title":"The Interval Function of a Graph","author":"H.M. Mulder","year":"1980","unstructured":"Mulder, H.M.: The Interval Function of a Graph. Math. Centre Tracts, vol.\u00a0132. Mathematisch Centrum, Amsterdam (1980)"},{"key":"9200_CR20","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.orl.2005.02.004","volume":"34","author":"A. Tamir","year":"2006","unstructured":"Tamir, A.: Locating two obnoxious facilities using the weighted maximin criterion. Oper. Res. Lett. 34, 97\u2013105 (2006)","journal-title":"Oper. Res. Lett."},{"key":"9200_CR21","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s00453-007-9026-5","volume":"49","author":"A. Taranenko","year":"2007","unstructured":"Taranenko, A., Vesel, A.: Fast recognition of Fibonacci cubes. Algorithmica 49, 81\u201393 (2007)","journal-title":"Algorithmica"},{"key":"9200_CR22","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1287\/trsc.18.1.76","volume":"18","author":"S.S. Ting","year":"1984","unstructured":"Ting, S.S.: A linear-time algorithm for maxisum facility location on tree networks. Transp. Sci. 18, 76\u201384 (1984)","journal-title":"Transp. Sci."},{"key":"9200_CR23","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0012-365X(92)90054-J","volume":"102","author":"E. Wilkeit","year":"1992","unstructured":"Wilkeit, E.: The retracts of Hamming graphs. Discrete Math. 102, 197\u2013218 (1992)","journal-title":"Discrete Math."},{"key":"9200_CR24","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/S0166-218X(03)00452-9","volume":"136","author":"B. Zmazek","year":"2004","unstructured":"Zmazek, B., \u017derovnik, J.: The obnoxious center problem on weighted cactus graphs. Discrete Appl. Math. 136, 377\u2013386 (2004)","journal-title":"Discrete Appl. Math."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-008-9200-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-008-9200-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-008-9200-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:45:02Z","timestamp":1559137502000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-008-9200-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6,13]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,6]]}},"alternative-id":["9200"],"URL":"https:\/\/doi.org\/10.1007\/s00453-008-9200-4","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,6,13]]}}}