乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,24]],"date-time":"2024-04-24T19:59:11Z","timestamp":1713988751415},"reference-count":35,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2016,6,15]],"date-time":"2016-06-15T00:00:00Z","timestamp":1465948800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"funder":[{"DOI":"10.13039\/100005156","name":"Alexander von Humboldt-Stiftung","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100005156","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004350","name":"Studienstiftung des Deutschen Volkes","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004350","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["project DAMM (NI 369\/13), project PAWS (NI 369\/10), project DAPA (NI 369\/12)"],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002261","name":"Russian Foundation for Basic Research","doi-asserted-by":"publisher","award":["project 16-31-60007 mol_a_dk"],"id":[{"id":"10.13039\/501100002261","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[2017,6]]},"abstract":"Abstract<\/jats:title>The partition of graphs into \u201cnice\u201d subgraphs is a central algorithmic problem with strong ties to matching theory. We study the partitioning of undirected graphs into same\u2010size stars, a problem known to be NP\u2010complete even for the case of stars on three vertices. We perform a thorough computational complexity study of the problem on subclasses of perfect graphs and identify several polynomial\u2010time solvable cases, for example, on interval graphs and bipartite permutation graphs, and also NP\u2010complete cases, for example, on grid graphs and chordal graphs.<\/jats:p>","DOI":"10.1002\/jgt.22062","type":"journal-article","created":{"date-parts":[[2016,6,15]],"date-time":"2016-06-15T15:46:10Z","timestamp":1466005570000},"page":"297-335","source":"Crossref","is-referenced-by-count":10,"title":["Partitioning Perfect Graphs into Stars"],"prefix":"10.1002","volume":"85","author":[{"given":"Ren\u00e9","family":"van Bevern","sequence":"first","affiliation":[{"name":"NOVOSIBIRSK STATE UNIVERSITY NOVOSIBIRSK RUSSIAN FEDERATION"},{"name":"INSTITUT F\u00dcR SOFTWARETECHNIK UND THEORETISCHE INFORMATIK TU BERLIN BERLIN GERMANY"}]},{"given":"Robert","family":"Bredereck","sequence":"additional","affiliation":[{"name":"INSTITUT F\u00dcR SOFTWARETECHNIK UND THEORETISCHE INFORMATIK TU BERLIN BERLIN GERMANY"}]},{"given":"Laurent","family":"Bulteau","sequence":"additional","affiliation":[{"name":"INSTITUT GASPARD\u2010MONGE, UNIVERSIT\u00c9 PARIS\u2010EST MARNE\u2010LA\u2010VALL\u00c9E MARNE\u2010LA\u2010VALL\u00c9E FRANCE"}]},{"given":"Jiehua","family":"Chen","sequence":"additional","affiliation":[{"name":"INSTITUT F\u00dcR SOFTWARETECHNIK UND THEORETISCHE INFORMATIK TU BERLIN BERLIN GERMANY"}]},{"given":"Vincent","family":"Froese","sequence":"additional","affiliation":[{"name":"INSTITUT F\u00dcR SOFTWARETECHNIK UND THEORETISCHE INFORMATIK TU BERLIN BERLIN GERMANY"}]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[{"name":"INSTITUT F\u00dcR SOFTWARETECHNIK UND THEORETISCHE INFORMATIK TU BERLIN BERLIN GERMANY"}]},{"given":"Gerhard J.","family":"Woeginger","sequence":"additional","affiliation":[{"name":"DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE TU EINDHOVEN EINDHOVEN THE NETHERLANDS"}]}],"member":"311","published-online":{"date-parts":[[2016,6,15]]},"reference":[{"key":"e_1_2_10_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.05.012"},{"key":"e_1_2_10_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(90)90001-U"},{"key":"e_1_2_10_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/140978880"},{"key":"e_1_2_10_5_1","doi-asserted-by":"crossref","unstructured":"R.vanBevern C.Komusiewicz H.Moser andR.Niedermeier Measuring indifference: Unit interval vertex deletion Proceedings of the 36th International Workshop on Graph\u2010Theoretic Concepts in Computer Science (WG '10) volume 6410 ofLNCS Springer Berlin Heidelberg 2010 pp.232\u2013243.","DOI":"10.1007\/978-3-642-16926-7_22"},{"key":"e_1_2_10_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-014-0398-5"},{"key":"e_1_2_10_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719796"},{"key":"e_1_2_10_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2012.08.026"},{"key":"e_1_2_10_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0885-064X(91)90006-J"},{"key":"e_1_2_10_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480100373455"},{"key":"e_1_2_10_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/0214065"},{"key":"e_1_2_10_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(88)90068-8"},{"key":"e_1_2_10_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(98)00006-7"},{"key":"e_1_2_10_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-003-0414-6"},{"key":"e_1_2_10_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(85)90008-3"},{"key":"e_1_2_10_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(86)90002-7"},{"key":"e_1_2_10_17_1","volume-title":"Computers and Intractability: A Guide to the Theory of NP\u2010Completeness","author":"Garey M. R.","year":"1979"},{"key":"e_1_2_10_18_1","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic M. C.","year":"2004"},{"key":"e_1_2_10_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/0212040"},{"key":"e_1_2_10_20_1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.20231"},{"key":"e_1_2_10_21_1","doi-asserted-by":"crossref","unstructured":"A.Kosowski M.Ma\u0142afiejski andP.\u017by\u013ainski Parallel processing subsystems with redundancy in a distributed environment Proceedings of the 6th International Conference on Parallel Processing and Applied Mathematics (PPAM '05) volume 3911 ofLNCS Springer Berlin Heidelberg 2006 pp.1002\u20131009.","DOI":"10.1007\/11752578_121"},{"key":"e_1_2_10_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2013.06.003"},{"key":"e_1_2_10_23_1","doi-asserted-by":"crossref","unstructured":"M.Ma\u0142afiejskiandP.\u017byli\u0144ski Weakly cooperative guards in grids Proceedings of the International Conference on Computational Science and Its Applications (ICCSA '05) volume 3480 ofLNCS Springer Berlin Heidelberg 2005 pp.647\u2013656.","DOI":"10.1007\/11424758_68"},{"key":"e_1_2_10_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2006.12.004"},{"key":"e_1_2_10_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(03)00298-9"},{"key":"e_1_2_10_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-012-9412-5"},{"key":"e_1_2_10_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02187706"},{"key":"e_1_2_10_28_1","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"Schrijver A.","year":"2003"},{"key":"e_1_2_10_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(87)80003-3"},{"key":"e_1_2_10_30_1","first-page":"89","article-title":"On the k\u2010path partition problem in cographs","volume":"147","author":"Steiner G.","year":"2000","journal-title":"Congr Numer"},{"key":"e_1_2_10_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00577-7"},{"key":"e_1_2_10_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/322326.322328"},{"key":"e_1_2_10_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2011.09.003"},{"key":"e_1_2_10_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(97)00012-7"},{"key":"e_1_2_10_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(96)00094-7"},{"key":"e_1_2_10_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2007.07.002"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.22062","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.22062","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.22062","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,6]],"date-time":"2023-10-06T03:40:55Z","timestamp":1696563655000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.22062"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,15]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["10.1002\/jgt.22062"],"URL":"https:\/\/doi.org\/10.1002\/jgt.22062","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6,15]]}}}