{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T21:18:30Z","timestamp":1726003110983},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030050566"},{"type":"electronic","value":"9783030050573"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","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-05057-3_27","type":"book-chapter","created":{"date-parts":[[2018,12,7]],"date-time":"2018-12-07T00:52:26Z","timestamp":1544143946000},"page":"342-354","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Towards the Independent Spanning Trees in the Line Graphs of Interconnection Networks"],"prefix":"10.1007","author":[{"given":"Baolei","family":"Cheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianxi","family":"Fan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoyan","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guijuan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingya","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuejuan","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,12,7]]},"reference":[{"issue":"1","key":"27_CR1","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.dam.2015.01.012","volume":"186","author":"F Bonomom","year":"2015","unstructured":"Bonomom, F., Dur\u00e1n, G., Safe, M.D., Wagler, A.K.: Clique-perfectness of complements of line graphs. Discret. Appl. Math. 186(1), 19\u201344 (2015)","journal-title":"Discret. Appl. Math."},{"key":"27_CR2","first-page":"796","volume":"E81\u2013A","author":"F Bao","year":"1998","unstructured":"Bao, F., Funyu, Y., Hamada, Y., Igarashi, Y.: Reliable broadcasting and secure distributing in channel networks. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E81\u2013A, 796\u2013806 (1998)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"issue":"1\u20133","key":"27_CR3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0166-218X(97)00100-5","volume":"83","author":"F Bao","year":"1998","unstructured":"Bao, F., Igarashi, Y., \u00d6hring, S.R.: Reliable broadcasting in product networks. Discret. Appl. Math. 83(1\u20133), 3\u201320 (1998)","journal-title":"Discret. Appl. Math."},{"issue":"9","key":"27_CR4","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1016\/j.sysarc.2004.01.001","volume":"50","author":"Y-S Chen","year":"2004","unstructured":"Chen, Y.-S., Chiang, C.-Y., Chen, C.-Y.: Multi-node broadcasting in all-ported 3-D wormhole-routed torus using an aggregation-then-distribution strategy. J. Syst. Arch. 50(9), 575\u2013589 (2004)","journal-title":"J. Syst. Arch."},{"issue":"1","key":"27_CR5","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1016\/j.ins.2013.01.010","volume":"233","author":"B Cheng","year":"2013","unstructured":"Cheng, B., Fan, J., Jia, X., Zhang, S.: Independent spanning trees in crossed cubes. Inf. Sci. 233(1), 276\u2013289 (2013)","journal-title":"Inf. Sci."},{"key":"27_CR6","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1016\/j.jpdc.2013.01.009","volume":"73","author":"B Cheng","year":"2013","unstructured":"Cheng, B., Fan, J., Jia, X., Wang, J.: Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes. J. Parallel Distrib. Comput. 73, 641\u2013652 (2013)","journal-title":"J. Parallel Distrib. Comput."},{"key":"27_CR7","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1016\/j.future.2018.02.010","volume":"87","author":"B Cheng","year":"2018","unstructured":"Cheng, B., Fan, J., Lyu, Q., Zhou, J., Liu, Z.: Constructing independent spanning trees with height $$n$$ on the $$n$$-dimensional crossed cube. Futur. Gener. Comput. Syst. 87, 404\u2013415 (2018)","journal-title":"Futur. Gener. Comput. Syst."},{"issue":"3","key":"27_CR8","doi-asserted-by":"crossref","first-page":"1279","DOI":"10.1007\/s11227-013-0883-1","volume":"65","author":"B Cheng","year":"2013","unstructured":"Cheng, B., Fan, J., Jia, X., Jia, J.: Parallel construction of independent spanning trees and an application in diagnosis on M\u00f6bius cubes. J. Supercomput. 65(3), 1279\u20131301 (2013)","journal-title":"J. Supercomput."},{"issue":"4","key":"27_CR9","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1016\/0196-6774(88)90015-6","volume":"9","author":"J Cheriyan","year":"1988","unstructured":"Cheriyan, J., Maheshwari, S.N.: Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs. J. Algorithms 9(4), 507\u2013537 (1988)","journal-title":"J. Algorithms"},{"issue":"5","key":"27_CR10","doi-asserted-by":"crossref","first-page":"1023","DOI":"10.1137\/S0097539703436734","volume":"35","author":"S Curran","year":"2006","unstructured":"Curran, S., Lee, O., Yu, X.: Finding four independent trees. SIAM J. Comput. 35(5), 1023\u20131058 (2006)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"27_CR11","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1002\/jgt.22048","volume":"85","author":"F Dong","year":"2017","unstructured":"Dong, F., Yan, W.: Expression for the number of spanning trees of line graphs of arbitrary connected graphs. J. Graph Theory 85(1), 74\u201393 (2017)","journal-title":"J. Graph Theory"},{"issue":"14\u201316","key":"27_CR12","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1016\/j.ipl.2013.04.008","volume":"113","author":"A Gopalan","year":"2013","unstructured":"Gopalan, A., Ramasubramanian, S.: A counterexample for the proof of implication conjecture on independent spanning trees. Inf. Process. Lett. 113(14\u201316), 522\u2013526 (2013)","journal-title":"Inf. Process. Lett."},{"key":"27_CR13","unstructured":"Gopalan, A., Ramasubramanian, S.: On constructing three edge independent spanning trees. SIAM J. Comput. (2011, submitted)"},{"key":"27_CR14","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/j.jda.2015.01.008","volume":"31","author":"T Hasunuma","year":"2015","unstructured":"Hasunuma, T.: Structural properties of subdivided-line graphs. J. Discret. Algorithms 31, 69\u201386 (2015)","journal-title":"J. Discret. Algorithms"},{"issue":"1","key":"27_CR15","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1002\/jgt.21813","volume":"79","author":"DJ Harvey","year":"2015","unstructured":"Harvey, D.J., Wood, D.R.: Treewidth of the line graph of a complete graph. J. Graph Theory 79(1), 48\u201354 (2015)","journal-title":"J. Graph Theory"},{"issue":"1","key":"27_CR16","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1137\/17M1134056","volume":"32","author":"A Hoyer","year":"2018","unstructured":"Hoyer, A., Thomas, R.: Four edge-independent spanning tree. SIAM J. Discret. Math. 32(1), 233\u2013248 (2018)","journal-title":"SIAM J. Discret. Math."},{"issue":"1","key":"27_CR17","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF01202468","volume":"15","author":"A Huck","year":"1999","unstructured":"Huck, A.: Independent trees in planar graphs. Graphs Comb. 15(1), 29\u201377 (1999)","journal-title":"Graphs Comb."},{"key":"27_CR18","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1016\/j.jpdc.2017.06.018","volume":"109","author":"Z Hussain","year":"2017","unstructured":"Hussain, Z., AlBdaiwi, B., Cerny, A.: Node-independent spanning trees in Gaussian networks. J. Parallel Distrib. Comput. 109, 324\u2013332 (2017)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"11","key":"27_CR19","doi-asserted-by":"crossref","first-page":"3210","DOI":"10.1109\/TC.2015.2389847","volume":"64","author":"D Li","year":"2015","unstructured":"Li, D., Wu, J.: On data center network architectures for interconnecting dual-port servers. IEEE Trans. Comput. 64(11), 3210\u20133222 (2015)","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"27_CR20","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0890-5401(88)90016-8","volume":"79","author":"A Itai","year":"1988","unstructured":"Itai, A., Rodeh, M.: The multi-tree approach to reliability in distributed networks. Inf. Comput. 79(1), 43\u201359 (1988)","journal-title":"Inf. Comput."},{"issue":"6","key":"27_CR21","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0020-0190(92)90230-S","volume":"42","author":"S Khuller","year":"1992","unstructured":"Khuller, S., Schieber, B.: On independent spanning trees. Inf. Process. Lett. 42(6), 321\u2013323 (1992)","journal-title":"Inf. Process. Lett."},{"issue":"13","key":"27_CR22","doi-asserted-by":"crossref","first-page":"2892","DOI":"10.1016\/j.ins.2011.02.012","volume":"181","author":"J-S Kim","year":"2011","unstructured":"Kim, J.-S., Lee, H.-O., Cheng, E., Lipt\u00e1k, L.: Independent spanning trees on even networks. Inf. Sci. 181(13), 2892\u20132905 (2011)","journal-title":"Inf. Sci."},{"issue":"2","key":"27_CR23","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1007\/s11227-009-0363-9","volume":"56","author":"J-S Kim","year":"2011","unstructured":"Kim, J.-S., Lee, H.-O., Cheng, E., Lipt\u00e1k, L.: Optimal independent spanning trees on odd graphs. J. Supercomput. 56(2), 212\u2013225 (2011)","journal-title":"J. Supercomput."},{"key":"27_CR24","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1007\/s00373-015-1606-6","volume":"32","author":"H Li","year":"2016","unstructured":"Li, H., He, W., Yang, W., Bai, Y.: A note on edge-disjoint Hamilton cycles in line graphs. Graphs Comb. 32, 741\u2013744 (2016)","journal-title":"Graphs Comb."},{"issue":"22","key":"27_CR25","doi-asserted-by":"crossref","first-page":"2237","DOI":"10.1016\/j.tcs.2010.12.061","volume":"412","author":"Y-J Liu","year":"2011","unstructured":"Liu, Y.-J., Chou, W.Y., Lan, J.K., Chen, C.: Constructing independent spanning trees for locally twisted cubes. Theor. Comput. Sci. 412(22), 2237\u20132252 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"11","key":"27_CR26","first-page":"1894","volume":"E79\u2013A","author":"K Obokata","year":"1996","unstructured":"Obokata, K., Iwasaki, Y., Bao, F., Igarashi, Y.: Independent spanning trees of product graphs and their construction. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E79\u2013A(11), 1894\u20131903 (1996)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"27_CR27","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/j.amc.2014.10.053","volume":"253","author":"G Su","year":"2015","unstructured":"Su, G., Xu, L.: Topological indices of the line graph of subdivision graphs and their Schur-bounds. Appl. Math. Comput. 253, 395\u2013401 (2015)","journal-title":"Appl. Math. Comput."},{"key":"27_CR28","doi-asserted-by":"crossref","first-page":"1339","DOI":"10.1016\/j.amc.2017.10.043","volume":"321","author":"T Tian","year":"2018","unstructured":"Tian, T., Xiong, L.: Traceability on 2-connected line graphs. Appl. Math. Comput. 321, 1339\u20131351 (2018)","journal-title":"Appl. Math. Comput."},{"issue":"1","key":"27_CR29","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1109\/71.744837","volume":"10","author":"Y-C Tseng","year":"1999","unstructured":"Tseng, Y.-C., Wang, S.-Y., Ho, C.-W.: Efficient broadcasting in wormhole-routed multicomputers: a network-partitioning approach. IEEE Trans. Parallel Distrib. Syst. 10(1), 44\u201361 (1999)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"1","key":"27_CR30","first-page":"143","volume":"20","author":"S-M Tang","year":"2004","unstructured":"Tang, S.-M., Wang, Y.-L., Leu, Y.-H.: Optimal independent spanning trees on hypercubes. J. Inf. Sci. Eng. 20(1), 143\u2013155 (2004)","journal-title":"J. Inf. Sci. Eng."},{"issue":"2","key":"27_CR31","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1007\/s11390-018-1826-3","volume":"33","author":"X Wang","year":"2018","unstructured":"Wang, X., Fan, J., Lin, C.-K., Zhou, J., Liu, Z.: BCDC: a high-performance, server-centric data center network. J. Comput. Sci. Technol. 33(2), 400\u2013416 (2018)","journal-title":"J. Comput. Sci. Technol."},{"issue":"1","key":"27_CR32","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.parco.2006.12.001","volume":"33","author":"J-S Yang","year":"2007","unstructured":"Yang, J.-S., Tang, S.-M., Chang, J.-M., Wang, Y.-L.: Parallel construction of optimal independent spanning trees on hypercubes. Parallel Comput. 33(1), 73\u201379 (2007)","journal-title":"Parallel Comput."},{"issue":"2","key":"27_CR33","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1002\/jgt.3190130205","volume":"13","author":"A Zehavi","year":"1989","unstructured":"Zehavi, A., Itai, A.: Three tree-paths. J. Graph Theory 13(2), 175\u2013188 (1989)","journal-title":"J. Graph Theory"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-05057-3_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,7]],"date-time":"2022-09-07T20:29:09Z","timestamp":1662582549000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-05057-3_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030050566","9783030050573"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-05057-3_27","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":"ICA3PP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Architectures for Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/nsclab.org\/ica3pp2018\/authors.html","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"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"407","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"141","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"50","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"35% - 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"}},{"value":"2.3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"7.3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}