{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T06:18:43Z","timestamp":1725862723526},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319445427"},{"type":"electronic","value":"9783319445434"}],"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-319-44543-4_7","type":"book-chapter","created":{"date-parts":[[2016,8,8]],"date-time":"2016-08-08T11:49:58Z","timestamp":1470656998000},"page":"83-95","source":"Crossref","is-referenced-by-count":2,"title":["Directing Road Networks by Listing Strong Orientations"],"prefix":"10.1007","author":[{"given":"Alessio","family":"Conte","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Grossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Marino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Romeo","family":"Rizzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca","family":"Versari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,9]]},"reference":[{"issue":"3","key":"7_CR1","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/S0166-218X(01)00228-1","volume":"116","author":"EM Arkin","year":"2002","unstructured":"Arkin, E.M., Hassin, R.: A note on orientations of mixed graphs. Discrete Appl. Math. 116(3), 271\u2013278 (2002)","journal-title":"Discrete Appl. Math."},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/978-3-319-21398-9_2","volume-title":"Computing and Combinatorics","author":"W Ben-Ameur","year":"2015","unstructured":"Ben-Ameur, W., Glorieux, A., Neto, J.: On the most imbalanced orientation of a graph. In: Xu, D., Du, D., Du, D. (eds.) COCOON 2015. LNCS, vol. 9198, pp. 16\u201329. Springer, Heidelberg (2015)"},{"issue":"9","key":"7_CR3","doi-asserted-by":"crossref","first-page":"716","DOI":"10.2307\/2321858","volume":"87","author":"F Boesch","year":"1980","unstructured":"Boesch, F., Tindell, R.: Robbins\u2019 theorem for mixed multigraphs. Am. Math. Monthly 87(9), 716\u2013719 (1980)","journal-title":"Am. Math. Monthly"},{"key":"7_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0619-4","volume-title":"Modern Graph Theory","author":"B Bollob\u00e1s","year":"1998","unstructured":"Bollob\u00e1s, B.: Modern Graph Theory. Springer-Verlag, New York (1998)"},{"issue":"1","key":"7_CR5","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1002\/(SICI)1097-0037(199901)33:1<57::AID-NET4>3.0.CO;2-R","volume":"33","author":"E Rainer","year":"1999","unstructured":"Rainer, E., Feldbacher, K., Klinz, B., Woeginger, G.J.: Minimum-cost strong network orientation problems: classification, complexity, and algorithms. Networks 33(1), 57\u201370 (1999)","journal-title":"Networks"},{"key":"7_CR6","unstructured":"Chartrand, G., Harary, F., Schultz, M., Wall, C.E.: Forced orientation number of a graph. Congressus Numerantium, pp. 183\u2013192 (1994)"},{"issue":"4","key":"7_CR7","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1002\/net.3230150409","volume":"15","author":"FRK Chung","year":"1985","unstructured":"Chung, F.R.K., Garey, M.R., Tarjan, R.E.: Strongly connected orientations of mixed multigraphs. Networks 15(4), 477\u2013484 (1985)","journal-title":"Networks"},{"issue":"1","key":"7_CR8","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0095-8956(78)90078-3","volume":"24","author":"V Chv\u00e1tal","year":"1978","unstructured":"Chv\u00e1tal, V., Thomassen, C.: Distances in orientations of graphs. J. Comb. Theory Ser. B 24(1), 61\u201375 (1978)","journal-title":"J. Comb. Theory Ser. B"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/978-3-319-29516-9_8","volume-title":"Combinatorial Algorithms","author":"A Conte","year":"2016","unstructured":"Conte, A., Grossi, R., Marino, A., Rizzi, R.: Enumerating cyclic orientations of a graph. In: Lipt\u00e1k, Z., Smyth, W.F. (eds.) IWOCA 2015. LNCS, vol. 9538, pp. 88\u201399. Springer, Heidelberg (2016)"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Conte, A., Grossi, R., Marino, A., Rizzi, R.: Listing acyclic orientations of graphs with single, multiple sources. In: Proceedings LATIN (2011) Observation of strains: Theoretical Informatics - 12th Latin American Symposium, Ensenada, 11-15 April 2016, pp. 319\u2013333 (2016)","DOI":"10.1007\/978-3-662-49529-2_24"},{"issue":"1\u20133","key":"7_CR11","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1016\/j.dam.2004.01.005","volume":"143","author":"P Dankelmann","year":"2004","unstructured":"Dankelmann, P., Oellermann, O.R., Jian-Liang, W.: Minimum average distance of strong orientations of graphs. Discrete Appl. Math. 143(1\u20133), 204\u2013212 (2004)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"7_CR12","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0166-218X(03)00376-7","volume":"141","author":"EV Fomin","year":"2004","unstructured":"Fomin, E.V., Matamala, M., Prisner, E., Rapaport, I.: At-free graphs: linear bounds for the oriented diameter. Discrete Appl. Math. 141(1), 135\u2013148 (2004)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"7_CR13","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1002\/jgt.10160","volume":"45","author":"FV Fomin","year":"2004","unstructured":"Fomin, F.V., Matamala, M.: Complexity of approximating the oriented diameter of chordal graphs. J. Graph Theory 45(4), 255\u2013269 (2004)","journal-title":"J. Graph Theory"},{"issue":"1","key":"7_CR14","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/S0304-3975(00)00226-7","volume":"263","author":"K Fukuda","year":"2001","unstructured":"Fukuda, K., Prodon, A., Sakuma, T.: Combinatorics and computer science notes on acyclic orientations and the shelling lemma. Theoret. Comput. Sci. 263(1), 9\u201316 (2001)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"7_CR15","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BF02986669","volume":"10","author":"G Gutin","year":"1994","unstructured":"Gutin, G.: Minimizing and maximizing the diameter in orientations of graphs. Graphs Comb. 10(2), 225\u2013230 (1994)","journal-title":"Graphs Comb."},{"key":"7_CR16","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1016\/0024-3795(89)90481-3","volume":"114, 115","author":"R Hassin","year":"1989","unstructured":"Hassin, R., Megiddo, N.: On orientations, shortest paths. Linear Algebra Appl. 114, 115, 589\u2013602 (1989). Special Issue Dedicated to Alan J. Hoffman","journal-title":"Linear Algebra Appl."},{"key":"7_CR17","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/j.tcs.2011.11.011","volume":"447","author":"GF Italiano","year":"2012","unstructured":"Italiano, G.F., Laura, L., Santaroni, F.: Finding strong bridges and strong articulation points in linear time. Theoret. Comput. Sci. 447, 74\u201384 (2012)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"7_CR18","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1007\/s003730200060","volume":"18","author":"KM Koh","year":"2002","unstructured":"Koh, K.M., Tay, E.G.: Optimal orientations of graphs and digraphs: a survey. Graphs Comb. 18(4), 745\u2013756 (2002)","journal-title":"Graphs Comb."},{"issue":"1","key":"7_CR19","first-page":"109","volume":"14","author":"S Kurz","year":"2012","unstructured":"Kurz, S., L\u00e4tsch, M.: Bounds for the minimum oriented diameter. Discrete Math. Theoret. Comput. Sci. 14(1), 109\u2013140 (2012)","journal-title":"Discrete Math. Theoret. Comput. Sci."},{"issue":"1","key":"7_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/jgt.3190080102","volume":"8","author":"J Plesn\u00edk","year":"1984","unstructured":"Plesn\u00edk, J.: On the sum of all distances in a graph or digraph. J. Graph Theory 8(1), 1\u201321 (1984)","journal-title":"J. Graph Theory"},{"issue":"5","key":"7_CR21","doi-asserted-by":"crossref","first-page":"281","DOI":"10.2307\/2303897","volume":"46","author":"HE Robbins","year":"1939","unstructured":"Robbins, H.E.: A theorem on graphs, with an application to a problem of traffic control. The American Mathematical Monthly 46(5), 281\u2013283 (1939)","journal-title":"The American Mathematical Monthly"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Roberts, F.S.: Graph theory and its applications to problems of society. NSF-CBSM Monograph No. 29. SIAM Publications (1978)","DOI":"10.1137\/1.9781611970401"},{"issue":"2","key":"7_CR23","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1002\/net.3230190204","volume":"19","author":"FS Roberts","year":"1989","unstructured":"Roberts, F.S., Xu, Y.: On the optimal strongly connected orientations of city street graphs. II: two East-West avenues or North-South streets. Networks 19(2), 221\u2013233 (1989)","journal-title":"Networks"},{"issue":"2","key":"7_CR24","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1137\/0401022","volume":"1","author":"FS Roberts","year":"1988","unstructured":"Roberts, F.S., Xu, Y.: On the optimal strongly connected orientations of city street graphs I: large grids. SIAM J. Discrete Math. 1(2), 199\u2013222 (1988)","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"7_CR25","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1002\/net.3230220202","volume":"22","author":"FS Roberts","year":"1992","unstructured":"Roberts, F.S., Xu, Y.: On the optimal strongly connected orientations of city street graphs. III: three East-West avenues or North-South streets. Networks 22(2), 109\u2013143 (1992)","journal-title":"Networks"},{"issue":"1","key":"7_CR26","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/0166-218X(94)90217-8","volume":"49","author":"FS Roberts","year":"1994","unstructured":"Roberts, F.S., Xu, Y.: On the optimal strongly connected orientations of city street graphs IV: four East-West avenues or North-South streets. Discrete Appl. Math. 49(1), 331\u2013356 (1994)","journal-title":"Discrete Appl. Math."},{"key":"7_CR27","unstructured":"Uno, T.: Two general methods to reduce delay and change of enumeration algorithms: NII Technical report NII-2003-004E, Tokyo (2003)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44543-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T20:11:12Z","timestamp":1498335072000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44543-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319445427","9783319445434"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44543-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}