{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T03:20:02Z","timestamp":1725852002066},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662495285"},{"type":"electronic","value":"9783662495292"}],"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":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-49529-2_24","type":"book-chapter","created":{"date-parts":[[2016,3,21]],"date-time":"2016-03-21T08:09:41Z","timestamp":1458547781000},"page":"319-333","source":"Crossref","is-referenced-by-count":3,"title":["Listing Acyclic Orientations of Graphs with Single and Multiple Sources"],"prefix":"10.1007","author":[{"given":"Alessio","family":"Conte","sequence":"first","affiliation":[]},{"given":"Roberto","family":"Grossi","sequence":"additional","affiliation":[]},{"given":"Andrea","family":"Marino","sequence":"additional","affiliation":[]},{"given":"Romeo","family":"Rizzi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,22]]},"reference":[{"issue":"2","key":"24_CR1","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/BF01204715","volume":"12","author":"N Alon","year":"1992","unstructured":"Alon, N., Tarsi, M.: Colorings and orientations of graphs. Combinatorica 12(2), 125\u2013134 (1992)","journal-title":"Combinatorica"},{"issue":"2\u20133","key":"24_CR2","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1002\/rsa.3240060213","volume":"6","author":"N Alon","year":"1995","unstructured":"Alon, N., Tuza, Z.: The acyclic orientation game on random graphs. Random Struct. Algorithms 6(2\u20133), 261\u2013268 (1995)","journal-title":"Random Struct. Algorithms"},{"issue":"1","key":"24_CR3","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/S0020-0190(99)00120-9","volume":"72","author":"VC Barbosa","year":"1999","unstructured":"Barbosa, V.C., Szwarcfiter, J.L.: Generating all the acyclic orientations of an undirected graph. Inf. Process. Lett. 72(1), 71\u201374 (1999)","journal-title":"Inf. Process. Lett."},{"issue":"8","key":"24_CR4","doi-asserted-by":"publisher","first-page":"1340","DOI":"10.1016\/j.disc.2010.01.002","volume":"310","author":"B Benson","year":"2010","unstructured":"Benson, B., Chakrabarty, D., Tetali, P.: G-parking functions, acyclic orientations and spanning trees. Discrete Math. 310(8), 1340\u20131353 (2010)","journal-title":"Discrete Math."},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"Conte, A., Grossi, R., Marino, A., Rizzi, R.: Enumerating cyclic orientations of a graph. In: IWOCA, 26th International Workshop on Combinatorial Algorithms (2015, to appear)","DOI":"10.1007\/978-3-319-29516-9_8"},{"key":"24_CR6","volume-title":"Theory of Graphs: Proceedings of the Colloquium Held at Tihany, Hungary, September 1966","author":"P Erd\u0151s","year":"1968","unstructured":"Erd\u0151s, P., Katona, G., T\u00e1rsulat, B.J.M.: Theory of Graphs: Proceedings of the Colloquium Held at Tihany, Hungary, September 1966. Academic Press, New York (1968)"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Iriarte, B.: Graph orientations and linear extensions. In: DMTCS Proceedings, pp. 945\u2013956 (2014)","DOI":"10.46298\/dmtcs.2455"},{"issue":"3","key":"24_CR8","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"DS Johnson","year":"1988","unstructured":"Johnson, D.S., Papadimitriou, C.H., Yannakakis, M.: On generating all maximal independent sets. Inf. Process. Lett. 27(3), 119\u2013123 (1988)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"24_CR9","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1002\/net.3230140402","volume":"14","author":"R Johnson","year":"1984","unstructured":"Johnson, R.: Network reliability and acyclic orientations. Networks 14(4), 489\u2013505 (1984)","journal-title":"Networks"},{"issue":"2","key":"24_CR10","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1137\/0607036","volume":"7","author":"N Linial","year":"1986","unstructured":"Linial, N.: Hard enumeration problems in geometry and combinatorics. SIAM J. Algebraic Discrete Methods 7(2), 331\u2013335 (1986)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1017\/S0963548309990289","volume":"19","author":"O Pikhurko","year":"2010","unstructured":"Pikhurko, O.: Finding an unknown acyclic orientation of a given graph. Comb. Probab. Comput. 19, 121\u2013131 (2010)","journal-title":"Comb. Probab. Comput."},{"issue":"5","key":"24_CR12","first-page":"129","volume":"1","author":"B Roy","year":"1967","unstructured":"Roy, B.: Nombre chromatique et plus longs chemins d\u2019un graphe. Rev. Fr. D\u2019informatique Rech. Op\u00e9rationnelle 1(5), 129\u2013132 (1967)","journal-title":"Rev. Fr. D\u2019informatique Rech. Op\u00e9rationnelle"},{"issue":"1","key":"24_CR13","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/S0166-218X(00)00339-5","volume":"117","author":"B Schwikowski","year":"2002","unstructured":"Schwikowski, B., Speckenmeyer, E.: On enumerating all minimal solutions of feedback problems. Discrete Appl. Math. 117(1), 253\u2013265 (2002)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"24_CR14","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1006\/jagm.1997.0891","volume":"26","author":"MB Squire","year":"1998","unstructured":"Squire, M.B.: Generating the acyclic orientations of a graph. J. Algorithms 26(2), 275\u2013290 (1998)","journal-title":"J. Algorithms"},{"key":"24_CR15","series-title":"Modern Birkh\u00e4user Classics","first-page":"453","volume-title":"Classic Papers in Combinatorics","author":"R Stanley","year":"1987","unstructured":"Stanley, R.: Acyclic orientations of graphs. In: Gessel, I., Rota, G.-C. (eds.) Classic Papers in Combinatorics. Modern Birkh\u00e4user Classics, pp. 453\u2013460. Birkh\u00e4user, Boston (1987)"},{"key":"24_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-9763-6","volume-title":"What Is Enumerative Combinatorics?","author":"RP Stanley","year":"1986","unstructured":"Stanley, R.P.: What Is Enumerative Combinatorics?. Springer, New York (1986)"},{"key":"24_CR17","first-page":"728","volume":"147","author":"LM Vitaver","year":"1962","unstructured":"Vitaver, L.M.: Determination of minimal coloring of vertices of a graph by means of boolean powers of the incidence matrix. Dokl. Akad. Nauk SSSR 147, 728 (1962)","journal-title":"Dokl. Akad. Nauk SSSR"}],"container-title":["Lecture Notes in Computer Science","LATIN 2016: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49529-2_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,15]],"date-time":"2022-06-15T19:16:04Z","timestamp":1655320564000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49529-2_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662495285","9783662495292"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49529-2_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}