{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:05:41Z","timestamp":1742911541905,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319487489"},{"type":"electronic","value":"9783319487496"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-48749-6_5","type":"book-chapter","created":{"date-parts":[[2016,10,30]],"date-time":"2016-10-30T04:16:59Z","timestamp":1477801019000},"page":"62-76","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Strong Tree-Breadth"],"prefix":"10.1007","author":[{"given":"Arne","family":"Leitert","sequence":"first","affiliation":[]},{"given":"Feodor F.","family":"Dragan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,10,31]]},"reference":[{"issue":"1","key":"5_CR1","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1002\/net.21631","volume":"67","author":"M Abu-Ata","year":"2016","unstructured":"Abu-Ata, M., Dragan, F.F.: Metric tree-like structures in real-life networks: an empirical study. Networks 67(1), 49\u201368 (2016)","journal-title":"Networks"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/0095-8956(86)90043-2","volume":"41","author":"H-J Bandelt","year":"1986","unstructured":"Bandelt, H.-J., Mulder, H.M.: Distance-hereditary graphs. J. Comb. Theory Ser. B 41, 182\u2013208 (1986)","journal-title":"J. Comb. Theory Ser. B"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0166-218X(97)00125-X","volume":"82","author":"A Brandst\u00e4dt","year":"1998","unstructured":"Brandst\u00e4dt, A., Chepoi, V.D., Dragan, F.F.: The algorithmic use of hypertree structure and maximum neighborhood orderings. Discret. Appl. Math. 82, 43\u201377 (1998)","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"5_CR4","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1137\/S0895480193253415","volume":"11","author":"A Brandst\u00e4dt","year":"1998","unstructured":"Brandst\u00e4dt, A., Dragan, F.F., Chepoi, V.D., Voloshin, V.: Dually chordal graphs. SIAM J. Discret. Math. 11(3), 437\u2013455 (1998)","journal-title":"SIAM J. Discret. Math."},{"issue":"2","key":"5_CR5","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/j.ipl.2014.09.024","volume":"115","author":"A Brandst\u00e4dt","year":"2015","unstructured":"Brandst\u00e4dt, A., Fi\u010dur, P., Leitert, A., Milani\u010d, M.: Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs. Inf. Process. Lett. 115(2), 256\u2013262 (2015)","journal-title":"Inf. Process. Lett."},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-642-35261-4_30","volume-title":"Algorithms and Computation","author":"A Brandst\u00e4dt","year":"2012","unstructured":"Brandst\u00e4dt, A., Leitert, A., Rautenbach, D.: Efficient dominating and edge dominating sets for graphs and hypergraphs. In: Chao, K.-M., Hsu, T., Lee, D.-T. (eds.) ISAAC 2012. LNCS, vol. 7676, pp. 267\u2013277. Springer, Heidelberg (2012)"},{"issue":"1\u20132","key":"5_CR7","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0304-3975(00)00234-6","volume":"263","author":"G Damiand","year":"2001","unstructured":"Damiand, G., Habib, M., Paul, C.: A simple paradigm for graph recognition: application to cographs and distance hereditary graphs. Theoret. Comput. Sci. 263(1\u20132), 99\u2013111 (2001)","journal-title":"Theoret. Comput. Sci."},{"issue":"16","key":"5_CR8","doi-asserted-by":"publisher","first-page":"2008","DOI":"10.1016\/j.disc.2005.12.060","volume":"307","author":"Y Dourisboure","year":"2007","unstructured":"Dourisboure, Y., Gavoille, C.: Tree-decompositions with bags of small diameter. Discret. Math. 307(16), 2008\u20132029 (2007)","journal-title":"Discret. Math."},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"884","DOI":"10.1007\/s00453-013-9765-4","volume":"69","author":"FF Dragan","year":"2014","unstructured":"Dragan, F.F., K\u00f6hler, E.: An approximation algorithm for the tree t-spanner problem on unweighted graphs via generalized chordal graphs. Algorithmica 69, 884\u2013905 (2014)","journal-title":"Algorithmica"},{"key":"5_CR10","unstructured":"Dragan, F.F., K\u00f6hler, E., Leitert, A.: Line-distortion, bandwidth and path-length of a graph. Algorithmica (in print)"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"1458","DOI":"10.1016\/j.dam.2007.03.011","volume":"155","author":"FF Dragan","year":"2007","unstructured":"Dragan, F.F., Lomonosov, I.: On compact and efficient routing in certain graph classes. Discret. Appl. Math. 155, 1458\u20131470 (2007)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"5_CR12","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1137\/090761549","volume":"25","author":"FF Dragan","year":"2011","unstructured":"Dragan, F.F., Matamala, M.: Navigating in a graph by aid of its spanning tree. SIAM J. Discret. Math. 25(1), 306\u2013332 (2011)","journal-title":"SIAM J. Discret. Math."},{"key":"5_CR13","unstructured":"Ducoffe, G., Legay, S., Nisse, N.: On computing tree and path decompositions with metric constraints on the bags. CoRR abs\/1601.01958 (2016)"},{"issue":"1\u20132","key":"5_CR14","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/BF01917434","volume":"8","author":"R Halin","year":"1976","unstructured":"Halin, R.: S-functions for graphs. J. Geom. 8(1\u20132), 171\u2013186 (1976)","journal-title":"J. Geom."},{"issue":"1","key":"5_CR15","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0095-8956(83)90079-5","volume":"35","author":"N Robertson","year":"1983","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. I. Excluding a forest. J. Comb. Theory Ser. B 35(1), 39\u201361 (1983)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"5_CR16","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0095-8956(84)90013-3","volume":"36","author":"N Robertson","year":"1984","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. III. Planar tree-width. J. Comb. Theory Ser. B 36(1), 49\u201364 (1984)","journal-title":"J. Comb. Theory Ser. B"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of the Tenth Annual ACM Symposium on Theory of Computing (STOC 1978), pp. 216\u2013226 (1978)","DOI":"10.1145\/800133.804350"},{"issue":"3","key":"5_CR18","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1137\/0213035","volume":"13","author":"RE Tarjan","year":"1984","unstructured":"Tarjan, R.E., Yannakakis, M.: Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J. Comput. 13(3), 566\u2013579 (1984)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-48749-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T22:20:03Z","timestamp":1558477203000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-48749-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319487489","9783319487496"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-48749-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"31 October 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 December 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 December 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conference.cs.cityu.edu.hk\/cocoa2016\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}