{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:00:02Z","timestamp":1753887602140,"version":"3.41.2"},"reference-count":22,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2019,3,10]],"date-time":"2019-03-10T00:00:00Z","timestamp":1552176000000},"content-version":"vor","delay-in-days":68,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11871280","11471003","11801378","11401389"],"award-info":[{"award-number":["11871280","11471003","11801378","11401389"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004731","name":"Natural Science Foundation of Zhejiang Province","doi-asserted-by":"publisher","award":["LY17A010017","LY18A010002","LQ17A010004"],"award-info":[{"award-number":["LY17A010017","LY18A010002","LQ17A010004"]}],"id":[{"id":"10.13039\/501100004731","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2019,1]]},"abstract":"<jats:p>The scattering number and isolated scattering number of a graph have been introduced in relation to Hamiltonian properties and network vulnerability, and the isolated scattering number plays an important role in characterizing graphs with a fractional 1\u2010factor. Here we investigate the computational complexity of one variant, namely, the weighted isolated scattering number. We give a polynomial time algorithm to compute this parameter of interval graphs, an important subclass of perfect graphs.<\/jats:p>","DOI":"10.1155\/2019\/4318261","type":"journal-article","created":{"date-parts":[[2019,3,10]],"date-time":"2019-03-10T23:31:01Z","timestamp":1552260661000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Computing the Weighted Isolated Scattering Number of Interval Graphs in Polynomial Time"],"prefix":"10.1155","volume":"2019","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2791-1683","authenticated-orcid":false,"given":"Fengwei","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2224-1484","authenticated-orcid":false,"given":"Xiaoyan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qingfang","family":"Ye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuefang","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2019,3,10]]},"reference":[{"key":"e_1_2_7_1_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2"},{"key":"e_1_2_7_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(78)90013-8"},{"key":"e_1_2_7_3_2","first-page":"861","article-title":"The isolated scattering number of graphs","volume":"54","author":"Wang S. Y.","year":"2011","journal-title":"Acta Mathematica Sinica"},{"volume-title":"Fractional Graph Theory","year":"1997","author":"Scheinerman E. R.","key":"e_1_2_7_4_2"},{"key":"e_1_2_7_5_2","doi-asserted-by":"publisher","DOI":"10.1080\/00207160211919"},{"key":"e_1_2_7_6_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.21832"},{"key":"e_1_2_7_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2017.01.023"},{"key":"e_1_2_7_8_2","doi-asserted-by":"publisher","DOI":"10.1017\/S1446181117000062"},{"key":"e_1_2_7_9_2","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1964-055-5"},{"key":"e_1_2_7_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-54029-6_157"},{"volume-title":"Automatic Storage Optimization","year":"1982","author":"Fabri J.","key":"e_1_2_7_11_2"},{"key":"e_1_2_7_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/0303-2647(82)90010-7"},{"key":"e_1_2_7_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCS.1979.1084695"},{"key":"e_1_2_7_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-97881-4"},{"key":"e_1_2_7_15_2","first-page":"627","article-title":"Average degree in the interval graph of a random boolean function","volume":"27","author":"Toman E.","year":"2008","journal-title":"Computing and Informatics"},{"key":"e_1_2_7_16_2","doi-asserted-by":"publisher","DOI":"10.3233\/FI-2013-790"},{"key":"e_1_2_7_17_2","first-page":"75","article-title":"On the correspondence between interval graphs and boolean functions","author":"Anh N. K.","year":"1993","journal-title":"Diskretnaya Matematika"},{"key":"e_1_2_7_18_2","first-page":"151","article-title":"Vertex degree in the interval graph of a random boolean function","volume":"79","author":"Daubner J.","year":"2010","journal-title":"Acta Mathematica Universitatis Comenianae"},{"key":"e_1_2_7_19_2","first-page":"191","article-title":"Properties of the interval graph of a boolean function","volume":"82","author":"Haviarov L.","year":"2013","journal-title":"Acta Mathematica Universitatis Comenianae"},{"key":"e_1_2_7_20_2","unstructured":"KratschD. KloksT. andM\u00fcllerH. Computing the toughness and the scattering number for interval and other graphs IRISA Research Report 1994 France."},{"key":"e_1_2_7_21_2","first-page":"77","article-title":"The weighted integrity problem is polynomial for interval graphs","volume":"79","author":"Ray S.","year":"2006","journal-title":"Ars Combinatoria"},{"volume-title":"Algorithmic Graph Theory and Perfect Graphs","year":"1980","author":"Golumbic M. C.","key":"e_1_2_7_22_2"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2019\/4318261.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2019\/4318261.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2019\/4318261","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T12:35:32Z","timestamp":1723034132000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2019\/4318261"}},"subtitle":[],"editor":[{"given":"Eulalia","family":"Mart\u00ednez","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2019,1]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["10.1155\/2019\/4318261"],"URL":"https:\/\/doi.org\/10.1155\/2019\/4318261","archive":["Portico"],"relation":{},"ISSN":["1076-2787","1099-0526"],"issn-type":[{"type":"print","value":"1076-2787"},{"type":"electronic","value":"1099-0526"}],"subject":[],"published":{"date-parts":[[2019,1]]},"assertion":[{"value":"2018-12-27","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-02-19","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-03-10","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"4318261"}}