{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:12Z","timestamp":1759639092436,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030002558"},{"type":"electronic","value":"9783030002565"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-00256-5_30","type":"book-chapter","created":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T08:22:08Z","timestamp":1535790128000},"page":"369-381","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Characterization and Recognition of Tree 3-Spanner Admissible Directed Path Graphs of Diameter Three"],"prefix":"10.1007","author":[{"given":"B. S.","family":"Panda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anita","family":"Das","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,2]]},"reference":[{"key":"30_CR1","unstructured":"Awerbuch, B., Baratz, A., Peleg, D.: Efficient broadcast and light-weighted spanners, Manuscript (1992)"},{"key":"30_CR2","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-8858(86)90038-2","volume":"7","author":"HJ Bandelt","year":"1986","unstructured":"Bandelt, H.J., Dress, A.: Reconstructing the shape of a tree from observed dissimilarity data. Adv. Appl. Math. 7, 309\u2013343 (1986)","journal-title":"Adv. Appl. Math."},{"key":"30_CR3","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1006\/jagm.1998.0962","volume":"30","author":"A Brandst\u00e4dt","year":"1999","unstructured":"Brandst\u00e4dt, A., Chepoi, V., Dragan, F.F.: Distance approximating trees for chordal and dually chordal graphs. J Algorithms 30, 166\u2013184 (1999)","journal-title":"J Algorithms"},{"key":"30_CR4","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/S0304-3975(03)00424-9","volume":"310","author":"A Brandst\u00e4dt","year":"2004","unstructured":"Brandst\u00e4dt, A., Dragan, F.F., Le, H.O., Le, V.B.: Tree spanners on chordal graphs: complexity and algorithms. Theor. Comput. Sci 310, 329\u2013354 (2004)","journal-title":"Theor. Comput. Sci"},{"key":"30_CR5","unstructured":"Cai, L.: Tree spanners: spanning trees that approximate the distances, Ph.D. thesis, University of Toronto (1992)"},{"key":"30_CR6","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S0895480192237403","volume":"8","author":"L Cai","year":"1995","unstructured":"Cai, L., Corneil, D.G.: Tree spanners. SIAM J. Discret. Math. 8, 359\u2013387 (1995)","journal-title":"SIAM J. Discret. Math."},{"key":"30_CR7","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/BF02992776","volume":"25","author":"GA Dirac","year":"1961","unstructured":"Dirac, G.A.: On rigid circuit graphs. Abh. Math. Sem Univ. Hamburg 25, 71\u201376 (1961)","journal-title":"Abh. Math. Sem Univ. Hamburg"},{"key":"30_CR8","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/S0166-218X(00)00226-2","volume":"108","author":"SP Fekete","year":"2001","unstructured":"Fekete, S.P., Kremer, J.: Tree spanners in planar graphs. Discret. Appl. Math. 108, 85\u2013103 (2001)","journal-title":"Discret. Appl. Math."},{"key":"30_CR9","doi-asserted-by":"publisher","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","volume":"15","author":"DR Fulkerson","year":"1965","unstructured":"Fulkerson, D.R., Gross, O.A.: Incidence matrices and interval graphs. Pac. J. Math. 15, 835\u2013855 (1965)","journal-title":"Pac. J. Math."},{"key":"30_CR10","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0012-365X(75)90021-7","volume":"13","author":"F Gavril","year":"1975","unstructured":"Gavril, F.: A recognition algorithm for the intersection graphs of directed paths in directed trees. Discret. Math. 13, 237\u2013249 (1975)","journal-title":"Discret. Math."},{"key":"30_CR11","series-title":"Annals of Discrete Mathematics","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"MC Golumbic","year":"2004","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Annals of Discrete Mathematics, vol. 53. Elsevier, Amsterdam (2004)"},{"key":"30_CR12","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1002\/(SICI)1097-0037(199909)34:2<81::AID-NET1>3.0.CO;2-P","volume":"34","author":"HO Le","year":"1999","unstructured":"Le, H.O., Le, V.B.: Optimal tree 3-spanners in directed path graphs. Networks 34, 81\u201387 (1999)","journal-title":"Networks"},{"key":"30_CR13","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0020-0190(96)00078-6","volume":"59","author":"MS Madanlal","year":"1996","unstructured":"Madanlal, M.S., Venkatesan, G., Rangan, C.P.: Tree 3-spanners on interval, permutation and regular bipartite graphs. Inform. Process. Lett. 59, 97\u2013102 (1996)","journal-title":"Inform. Process. Lett."},{"key":"30_CR14","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0095-8956(86)90042-0","volume":"41","author":"CL Monma","year":"1986","unstructured":"Monma, C.L., Wei, V.K.: Intersection graphs of paths in a tree. J. Combin. Theory Ser. B 41, 141\u2013181 (1986)","journal-title":"J. Combin. Theory Ser. B"},{"key":"30_CR15","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1006\/jctb.2000.2001","volume":"81","author":"BS Panda","year":"2001","unstructured":"Panda, B.S.: The separator theorem for rooted directed vertex graphs. J. Combin. Theory Ser. B 81, 156\u2013162 (2001)","journal-title":"J. Combin. Theory Ser. B"},{"key":"30_CR16","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1002\/net.20198","volume":"50","author":"BS Panda","year":"2007","unstructured":"Panda, B.S., Das, A.: On tree 3-spanners in directed path graphs. Networks 50, 203\u2013210 (2007)","journal-title":"Networks"},{"key":"30_CR17","doi-asserted-by":"publisher","first-page":"2153","DOI":"10.1016\/j.dam.2008.06.026","volume":"157","author":"BS Panda","year":"2009","unstructured":"Panda, B.S., Das, A.: Tree 3-spanners in 2-sep directed path graphs: characterization, recognition, and construction. Discret. Appl. Math. 157, 2153\u20132169 (2009)","journal-title":"Discret. Appl. Math."},{"key":"30_CR18","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0012-365X(94)00163-9","volume":"146","author":"BS Panda","year":"1995","unstructured":"Panda, B.S., Mohanty, S.P.: Intersection graphs of vertex disjoint paths in a tree. Discret. Math. 146, 179\u2013209 (1995)","journal-title":"Discret. Math."},{"key":"30_CR19","series-title":"SIAM Monograph on Discrete Mathematics and Applications","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719772","volume-title":"Distributed Computing: A Locality-Sensitive Approach","author":"D Peleg","year":"2000","unstructured":"Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM Monograph on Discrete Mathematics and Applications. SIAM, Philadelphia (2000)"},{"key":"30_CR20","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1002\/jgt.3190130114","volume":"13","author":"D Peleg","year":"1989","unstructured":"Peleg, D., Schaffer, A.A.: Graph spanners. J. Graph Theory 13, 99\u2013116 (1989)","journal-title":"J. Graph Theory"},{"key":"30_CR21","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1006\/inco.1997.2641","volume":"136","author":"G Venkatesan","year":"1997","unstructured":"Venkatesan, G., Rotics, U., Madanlal, M., Makowsky, J.A., Rangan, C.P.: Restrictions of minimum spanner problems. Inform. Comput. 136, 143\u2013164 (1997)","journal-title":"Inform. Comput."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-00256-5_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T13:26:32Z","timestamp":1710336392000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-00256-5_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030002558","9783030002565"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00256-5_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"2 September 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cottbus","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.wg2018.b-tu.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"66","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"45% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11,5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}