{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T06:33:15Z","timestamp":1648708395492},"reference-count":12,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Inter. Net."],"published-print":{"date-parts":[[2021,6]]},"abstract":"<jats:p> Suppose that [Formula: see text] is an undirected graph. An ordered pair [Formula: see text] of the vertices of the graph [Formula: see text] is called a pendant pair for the graph if [Formula: see text] is a minimum cut separating [Formula: see text] and [Formula: see text] Stoer and Wagner obtained a global minimum cut of [Formula: see text] by using pendant pairs of [Formula: see text] and its contractions. A Gomory Hu tree of the graph [Formula: see text] is a very useful data structure which gives us all the minimum s-t cuts of [Formula: see text] for every pair of distinct vertices [Formula: see text] and [Formula: see text] In this paper, we construct a new type of tree for the graph [Formula: see text] called cut star, by using pendant pairs of [Formula: see text] and its contractions. A cut star of the graph [Formula: see text] is constructed more quickly than a Gomory Hu tree of [Formula: see text] We characterize a class of graphs for which a cut star of a graph of this class is also a Gomory Hu tree. <\/jats:p>","DOI":"10.1142\/s0219265921500067","type":"journal-article","created":{"date-parts":[[2021,6,17]],"date-time":"2021-06-17T08:56:11Z","timestamp":1623920171000},"page":"2150006","source":"Crossref","is-referenced-by-count":0,"title":["Cut Star of an Undirected Graph"],"prefix":"10.1142","volume":"21","author":[{"given":"Saeid","family":"Hanifehnezhad","sequence":"first","affiliation":[{"name":"Department of Computer Science, Shahed University, Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ardeshir","family":"Dolati","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Shahed University, Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2021,7,18]]},"reference":[{"key":"S0219265921500067BIB002","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1979.1675348"},{"key":"S0219265921500067BIB003","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721649"},{"key":"S0219265921500067BIB004","doi-asserted-by":"publisher","DOI":"10.1137\/0405004"},{"key":"S0219265921500067BIB005","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792251730"},{"key":"S0219265921500067BIB006","volume-title":"Network Flows, Theory, Algorithms and Applications","author":"Orlin J. B.","year":"1993"},{"key":"S0219265921500067BIB007","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242598"},{"key":"S0219265921500067BIB008","doi-asserted-by":"publisher","DOI":"10.1145\/263867.263872"},{"key":"S0219265921500067BIB009","doi-asserted-by":"publisher","DOI":"10.1109\/NOMS.2016.7502855"},{"key":"S0219265921500067BIB010","doi-asserted-by":"publisher","DOI":"10.1137\/0109047"},{"key":"S0219265921500067BIB011","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-68953-1_3"},{"key":"S0219265921500067BIB012","doi-asserted-by":"publisher","DOI":"10.1007\/BF01304933"},{"key":"S0219265921500067BIB013","doi-asserted-by":"publisher","DOI":"10.4304\/jsw.6.12.2421-2425"}],"container-title":["Journal of Interconnection Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219265921500067","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,21]],"date-time":"2021-07-21T09:28:38Z","timestamp":1626859718000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0219265921500067"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6]]},"references-count":12,"journal-issue":{"issue":"02","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["10.1142\/S0219265921500067"],"URL":"https:\/\/doi.org\/10.1142\/s0219265921500067","relation":{},"ISSN":["0219-2659","1793-6713"],"issn-type":[{"value":"0219-2659","type":"print"},{"value":"1793-6713","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6]]}}}