{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T13:27:34Z","timestamp":1762176454274},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,9,1]],"date-time":"2010-09-01T00:00:00Z","timestamp":1283299200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Classif"],"published-print":{"date-parts":[[2010,9]]},"DOI":"10.1007\/s00357-010-9055-7","type":"journal-article","created":{"date-parts":[[2010,9,1]],"date-time":"2010-09-01T04:08:54Z","timestamp":1283314134000},"page":"158-172","source":"Crossref","is-referenced-by-count":8,"title":["An Algorithm for Computing Cutpoints in Finite Metric Spaces"],"prefix":"10.1007","volume":"27","author":[{"given":"Andreas","family":"Dress","sequence":"first","affiliation":[]},{"given":"Katharina T.","family":"Huber","sequence":"additional","affiliation":[]},{"given":"Jacobus","family":"Koolen","sequence":"additional","affiliation":[]},{"given":"Vincent","family":"Moulton","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"Spillner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,9,2]]},"reference":[{"key":"9055_CR1","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0001-8708(92)90061-O","volume":"92","author":"HJ Bandelt","year":"1992","unstructured":"BANDELT, H. J., and DRESS, A. (1992), \u201cA Canonical Decomposition Theory for Metrics on a Finite Set\u201d, Advances in Mathematics, 92, 47\u2013105.","journal-title":"Advances in Mathematics"},{"key":"9055_CR2","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1006\/aama.2001.0758","volume":"27","author":"D Bryant","year":"2001","unstructured":"BRYANT, D., and BERRY, V. (2001), \u201cA Structured Family of Clustering and Tree Construction Methods\u201d, Advances in Applied Mathematics, 27, 705\u2013732.","journal-title":"Advances in Applied Mathematics"},{"key":"9055_CR3","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1006\/jcss.2001.1785","volume":"63","author":"F Chung","year":"2001","unstructured":"CHUNG, F., GARRETT,M., GRAHAM, R., and SHALLCROSS, D. (2001), \u201cDistance Realization Problems with Applications to Internet Tomography\u201d, Journal of Computer and System Sciences, 63, 432\u2013448.","journal-title":"Journal of Computer and System Sciences"},{"key":"9055_CR4","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2001","unstructured":"CORMEN, T. H., LEISERSON, C. E., RIVEST, R. L., and STEIN, C. (2001), Introduction to Algorithms, Cambridge, MA: MIT Press."},{"key":"9055_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-04295-9","volume-title":"Geometry of Cuts and Metrics","author":"M Deza","year":"1997","unstructured":"DEZA, M., and LAURENT, M. (1997), Geometry of Cuts and Metrics, Berlin: Springer."},{"key":"9055_CR6","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0001-8708(84)90029-X","volume":"53","author":"A Dress","year":"1984","unstructured":"DRESS, A. (1984), \u201cTrees, Tight Extensions of Metric Spaces, and the Cohomological Dimension of Certain Groups: A Note on Combinatorial Properties of Metric Spaces\u201d, Advances in Mathematics, 53, 321\u2013402.","journal-title":"Advances in Mathematics"},{"key":"9055_CR7","doi-asserted-by":"crossref","unstructured":"DRESS, A., HUBER, K. T., KOOLEN, J., and MOULTON, V. (2007), \u201cAn Algorithm for Computing Virtual Cut Points in Finite Metric Spaces\u201d, in International Conference on Combinatorial Optimization and Applications (COCOA), volume 4616 of LNCS, eds. A.W.M. Dress, Y. Xu, B, Zhu, Springer, pp. 4\u201310.","DOI":"10.1007\/978-3-540-73556-4_3"},{"key":"9055_CR8","doi-asserted-by":"crossref","first-page":"1306","DOI":"10.1016\/j.aml.2008.01.004","volume":"21","author":"A Dress","year":"2008","unstructured":"DRESS, A., HUBER, K. T., KOOLEN, J., and MOULTON, V. (2008a), \u201cBlock Realizations of Finite Metrics and the Tight-span Construction I: The Embedding Theorem\u201d, Applied Mathematics Letters, 21, 1306\u20131309.","journal-title":"Applied Mathematics Letters"},{"key":"9055_CR9","doi-asserted-by":"crossref","first-page":"1617","DOI":"10.1016\/j.ejc.2007.10.003","volume":"29","author":"A Dress","year":"2008","unstructured":"DRESS, A., HUBER, K. T., KOOLEN, J., and MOULTON, V. (2008b), \u201cCompatible Decompositions and Block Realizations of Finite Metrics\u201d, European Journal of Combinatorics, 29, 1617\u20131633.","journal-title":"European Journal of Combinatorics"},{"key":"9055_CR10","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1016\/j.aml.2007.05.018","volume":"21","author":"A Dress","year":"2008","unstructured":"DRESS, A., HUBER, K. T., KOOLEN, J., and MOULTON, V. (2008c), \u201cCut Points in Metric Spaces\u201d, Applied Mathematics Letters, 21, 545\u2013548.","journal-title":"Applied Mathematics Letters"},{"key":"9055_CR11","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s004530010039","volume":"28","author":"T Gonzalez","year":"2000","unstructured":"GONZALEZ, T. (2000), \u201cSimple Algorithms for the On-line Multidimensional Dictionary and Related Problems\u201d, Algorithmica, 28, 255\u2013267.","journal-title":"Algorithmica"},{"key":"9055_CR12","doi-asserted-by":"crossref","first-page":"103","DOI":"10.5486\/PMD.1966.13.1-4.15","volume":"13","author":"F Harary","year":"1966","unstructured":"HARARY, F., and PRINS, G. (1966), \u201cThe Block-cutpoint-tree of a Graph\u201d, Publicationes Mathematicae Debrecen, 13, 103\u2013107.","journal-title":"Publicationes Mathematicae Debrecen"},{"key":"9055_CR13","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/s00357-007-0011-0","volume":"24","author":"A Hertz","year":"2007","unstructured":"HERTZ, A., and VARONE, S. (2007), \u201cThe Metric Bridge Partition Problem\u201d, Journal of Classification, 24, 235\u2013249.","journal-title":"Journal of Classification"},{"key":"9055_CR14","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/s00357-008-9016-6","volume":"25","author":"A Hertz","year":"2008","unstructured":"HERTZ, A., and VARONE, S. (2008), \u201cThe Metric Cutpoint Partition Problem\u201d, Journal of Classification, 25, 159\u2013175.","journal-title":"Journal of Classification"},{"key":"9055_CR15","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1093\/molbev\/msj030","volume":"23","author":"D Huson","year":"2005","unstructured":"HUSON, D., and BRYANT, D. (2005), \u201cApplication of Phylogenetic Networks in Evolutionary Studies\u201d, Molecular Biology and Evolution, 23, 254\u2013267.","journal-title":"Molecular Biology and Evolution"},{"key":"9055_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0095-8956(84)90009-1","volume":"36","author":"W Imrich","year":"1984","unstructured":"IMRICH, W., SIMOES-PEREIRA, J., and ZAMFIRESCU, C. (1984), \u201cOn Optimal Embeddings of Metrics in Graphs\u201d, Journal of Combinatorial Theory, Series B, 36, 1\u201315.","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"9055_CR17","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF02566944","volume":"39","author":"J Isbell","year":"1964","unstructured":"ISBELL, J. (1964), \u201cSix Theorems About Metric Spaces\u201d, Commentarii Mathematici Helvetici, 39, 65\u201374.","journal-title":"Commentarii Mathematici Helvetici"},{"key":"9055_CR18","doi-asserted-by":"crossref","first-page":"534","DOI":"10.4064\/fm-25-1-534-545","volume":"25","author":"C Kuratowski","year":"1935","unstructured":"KURATOWSKI, C. (1935), \u201cQuelques probl\u00e8mes concernant les espaces m\u00e9triques nons \u00e9perables\u201d, Fundamenta Mathematicae, 25, 534\u2013545.","journal-title":"Fundamenta Mathematicae"},{"key":"9055_CR19","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198509424.001.0001","volume-title":"Phylogenetics","author":"C Semple","year":"2003","unstructured":"SEMPLE, C., and STEEL, M. (2003), Phylogenetics, Oxford: Oxford University Press."},{"key":"9055_CR20","unstructured":"WEST, D. (1996), Introduction to Graph Theory, Prentice Hall."}],"container-title":["Journal of Classification"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00357-010-9055-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00357-010-9055-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00357-010-9055-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,30]],"date-time":"2024-03-30T00:12:08Z","timestamp":1711757528000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00357-010-9055-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,9]]}},"alternative-id":["9055"],"URL":"https:\/\/doi.org\/10.1007\/s00357-010-9055-7","relation":{},"ISSN":["0176-4268","1432-1343"],"issn-type":[{"value":"0176-4268","type":"print"},{"value":"1432-1343","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,9]]}}}