{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:33:50Z","timestamp":1742913230050,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319711461"},{"type":"electronic","value":"9783319711478"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-71147-8_20","type":"book-chapter","created":{"date-parts":[[2017,11,15]],"date-time":"2017-11-15T13:33:21Z","timestamp":1510752801000},"page":"291-305","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Tropical Paths in Vertex-Colored Graphs"],"prefix":"10.1007","author":[{"given":"Johanne","family":"Cohen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe F.","family":"Italiano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yannis","family":"Manoussakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kim Thang","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong Phong","family":"Pham","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,11,16]]},"reference":[{"issue":"1","key":"20_CR1","doi-asserted-by":"crossref","first-page":"P17","DOI":"10.37236\/504","volume":"18","author":"S Akbari","year":"2011","unstructured":"Akbari, S., Liaghat, V., Nikzad, A.: Colorful paths in vertex coloring of graphs. Electron. J. Comb. 18(1), P17 (2011)","journal-title":"Electron. J. Comb."},{"key":"20_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-319-30139-6_2","volume-title":"WALCOM: Algorithms and Computation","author":"J-A Angl\u00e9s d\u2019Auriac","year":"2016","unstructured":"Angl\u00e9s d\u2019Auriac, J.-A., Bujt\u00e1s, C., El Maftouhi, H., Karpinski, M., Manoussakis, Y., Montero, L., Narayanan, N., Rosaz, L., Thapper, J., Tuza, Z.: Tropical dominating sets in vertex-coloured graphs. In: Kaykobad, M., Petreschi, R. (eds.) WALCOM 2016. LNCS, vol. 9627, pp. 17\u201327. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-30139-6_2"},{"issue":"2","key":"20_CR3","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0020-0190(83)90078-9","volume":"17","author":"AA Bertossi","year":"1983","unstructured":"Bertossi, A.A.: Finding hamiltonian circuits in proper interval graphs. Inform. Process. Lett. 17(2), 97\u2013101 (1983)","journal-title":"Inform. Process. Lett."},{"key":"20_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/978-3-642-38527-8_17","volume-title":"Experimental Algorithms","author":"S Bruckner","year":"2013","unstructured":"Bruckner, S., H\u00fcffner, F., Komusiewicz, C., Niedermeier, R.: Evaluation of ILP-based approaches for partitioning into colorful components. In: Bonifaci, V., Demetrescu, C., Marchetti-Spaccamela, A. (eds.) SEA 2013. LNCS, vol. 7933, pp. 176\u2013187. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38527-8_17"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Cohen, J., Manoussakis, Y., Pham, H., Tuza, Z.: Tropical matchings in vertex-colored graphs. In: Latin and American Algorithms, Graphs and Optimization Symposium (2017)","DOI":"10.1007\/978-3-319-71147-8_20"},{"issue":"8","key":"20_CR6","doi-asserted-by":"publisher","first-page":"1015","DOI":"10.1093\/bioinformatics\/btq082","volume":"26","author":"E Corel","year":"2010","unstructured":"Corel, E., Pitschi, F., Morgenstern, B.: A min-cut algorithm for the consistency problem in multiple sequence alignment. Bioinformatics 26(8), 1015\u20131021 (2010)","journal-title":"Bioinformatics"},{"issue":"4","key":"20_CR7","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1016\/j.jcss.2010.07.003","volume":"77","author":"MR Fellows","year":"2011","unstructured":"Fellows, M.R., Fertin, G., Hermelin, D., Vialette, S.: Upper and lower bounds for finding connected motifs in vertex-colored graphs. J. Comput. Syst. Sci. 77(4), 799\u2013811 (2011)","journal-title":"J. Comput. Syst. Sci."},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Foucaud, F., Harutyunyan, A., Hell, P., Legay, S., Manoussakis, Y., Naserasr, R.: Tropical homomorphisms in vertex-coloured graphs. Discrete Appl. Math. 229, 1\u2013168 (2017)","DOI":"10.1016\/j.dam.2017.04.027"},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-642-03816-7_35","volume-title":"Mathematical Foundations of Computer Science 2009","author":"K Ioannidou","year":"2009","unstructured":"Ioannidou, K., Mertzios, G.B., Nikolopoulos, S.D.: The longest path problem is polynomial on interval graphs. In: Kr\u00e1lovi\u010d, R., Niwi\u0144ski, D. (eds.) MFCS 2009. LNCS, vol. 5734, pp. 403\u2013414. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03816-7_35"},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/3-540-57155-8_267","volume-title":"Algorithms and Data Structures","author":"D Karger","year":"1993","unstructured":"Karger, D., Motwani, R., Ramkumar, G.D.S.: On approximating the longest path in a graph. In: Dehne, F., Sack, J.-R., Santoro, N., Whitesides, S. (eds.) WADS 1993. LNCS, vol. 709, pp. 421\u2013432. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-57155-8_267"},{"issue":"4","key":"20_CR11","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/PL00007256","volume":"17","author":"H Li","year":"2001","unstructured":"Li, H.: A generalization of the Gallai-Roy theorem. Graphs Comb. 17(4), 681\u2013685 (2001)","journal-title":"Graphs Comb."},{"issue":"2","key":"20_CR12","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s00373-007-0694-3","volume":"23","author":"C Lin","year":"2007","unstructured":"Lin, C.: Simple proofs of results on paths representing all colors in proper vertex-colorings. Graphs Comb. 23(2), 201\u2013203 (2007)","journal-title":"Graphs Comb."},{"issue":"1\u20132","key":"20_CR13","first-page":"11","volume":"48","author":"D Marx","year":"2004","unstructured":"Marx, D.: Graph colouring problems and their applications in scheduling. Periodica Polytech. Electr. Eng. 48(1\u20132), 11\u201316 (2004)","journal-title":"Periodica Polytech. Electr. Eng."},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Micali, S., Vazirani, V.V.: An $${O}(\\sqrt{|V|} |{E}|)$$ algorithm for finding maximum matching in general graphs. In: Proceedings of 21st Symposium on Foundations of Computer Science, pp. 17\u201327 (1980)","DOI":"10.1109\/SFCS.1980.12"},{"key":"20_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1007\/978-3-540-30551-4_74","volume-title":"Algorithms and Computation","author":"R Uehara","year":"2004","unstructured":"Uehara, R., Uno, Y.: Efficient algorithms for the longest path problem. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol. 3341, pp. 871\u2013883. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30551-4_74"},{"issue":"2","key":"20_CR16","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.ipl.2007.02.010","volume":"103","author":"R Uehara","year":"2007","unstructured":"Uehara, R., Valiente, G.: Linear structure of bipartite permutation graphs and the longest path problem. Inform. Process. Lett. 103(2), 71\u201377 (2007)","journal-title":"Inform. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-71147-8_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:12:29Z","timestamp":1709809949000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-71147-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319711461","9783319711478"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-71147-8_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"16 November 2017","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":"Shanghai","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":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 December 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 December 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/anl.sjtu.edu.cn\/cocoa2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}