{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T06:25:53Z","timestamp":1766298353308,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540651956"},{"type":"electronic","value":"9783540494942"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"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":[[1998]]},"DOI":"10.1007\/10692760_14","type":"book-chapter","created":{"date-parts":[[2010,6,30]],"date-time":"2010-06-30T12:35:37Z","timestamp":1277901337000},"page":"164-176","source":"Crossref","is-referenced-by-count":6,"title":["Compact Implicit Representation of Graphs"],"prefix":"10.1007","author":[{"given":"Maurizio","family":"Talamo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paola","family":"Vocca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","volume-title":"Design and Analysis of Computer Algorithms","author":"A.V. Aho","year":"1974","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1109\/TIT.1966.1053860","volume":"12","author":"M. Breuer","year":"1966","unstructured":"Breuer, M.: Coding vertices of a graph. IEEE Trans. Infor. Theory\u00a012, 148\u2013153 (1966)","journal-title":"IEEE Trans. Infor. Theory"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1016\/0022-247X(67)90082-0","volume":"20","author":"M. Breuer","year":"1967","unstructured":"Breuer, M., Folkman, J.: An unexpected result on coding vertices. J. Math. Anal. Appl.\u00a020, 583\u2013600 (1967)","journal-title":"J. Math. Anal. Appl."},{"issue":"1","key":"14_CR4","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1145\/322358.322364","volume":"30","author":"G.N. Frederickson","year":"1980","unstructured":"Frederickson, G.N.: Implicit data structures for the dictionary problem. J. of the ACM\u00a030(1), 80\u201394 (1980)","journal-title":"J. of the ACM"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Frederickson, G.N., Janardan, R.: Optimal message routing without complete routing tables. In: Proc. 5th Annual ACM Symposium on Principles of Distributed Computing, Calgary, August 1986, pp. 88\u201397 (1986)","DOI":"10.1145\/10590.10598"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/BF01762113","volume":"3","author":"G.N. Frederickson","year":"1988","unstructured":"Frederickson, G.N., Janardan, R.: Designing networks with compact routing tables. Algorithmica\u00a03, 171\u2013190 (1988)","journal-title":"Algorithmica"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1137\/0218058","volume":"18","author":"G.N. Frederickson","year":"1989","unstructured":"Frederickson, G.N., Janardan, R.: Efficient message routing in planar networks. SIAM Journal on Computing\u00a018, 843\u2013857 (1989)","journal-title":"SIAM Journal on Computing"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1137\/0219011","volume":"19","author":"G.N. Frederickson","year":"1990","unstructured":"Frederickson, G.N., Janardan, R.: Space efficient message routing in c-decomposable networks. SIAM Journal on Computing\u00a019, 164\u2013181 (1990)","journal-title":"SIAM Journal on Computing"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/3-540-61769-8_14","volume-title":"Distributed Algorithms","author":"G. Gambosi","year":"1996","unstructured":"Gambosi, G., Vocca, P.: Topological Routing. In: Babao\u011flu, \u00d6., Marzullo, K. (eds.) WDAG 1996. LNCS, vol.\u00a01151, pp. 206\u2013219. Springer, Heidelberg (1996)"},{"key":"14_CR10","volume-title":"Graph Theory","author":"F. Harary","year":"1972","unstructured":"Harary, F.: Graph Theory. Addison-Wesley, Reading (1972)"},{"issue":"4","key":"14_CR11","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1137\/0405049","volume":"5","author":"S. Kannan","year":"1992","unstructured":"Kannan, S., Naor, M., Rudich, S.: Implicit representation of graphs. SIAM Journal of Discrete Mathematics\u00a05(4), 596\u2013603 (1992)","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/0022-0000(86)90043-7","volume":"33","author":"J. Munro lan","year":"1986","unstructured":"lan Munro, J.: An implicit data structure supporting inserting, deletion, and search in o(log2 n) time. J. of Comp. and Syst. Science\u00a033, 66\u201374 (1986)","journal-title":"J. of Comp. and Syst. Science"},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/0022-0000(80)90037-9","volume":"21","author":"J. Munro lan","year":"1980","unstructured":"lan Munro, J., Suwanda., H.: Implicit data structures for fast search and update. J. of Comp. and Syst. Science\u00a021, 236\u2013250 (1980)","journal-title":"J. of Comp. and Syst. Science"},{"issue":"6","key":"14_CR14","doi-asserted-by":"publisher","first-page":"1259","DOI":"10.1137\/S0097539793254571","volume":"24","author":"M. Naor","year":"1995","unstructured":"Naor, M., Stockmeyer, L.: What can be computed locally? SIAM J.Comput.\u00a024(6), 1259\u20131277 (1995)","journal-title":"SIAM J.Comput."},{"key":"14_CR15","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0020-0190(88)90058-0","volume":"29","author":"M. Ouksel","year":"1988","unstructured":"Ouksel, M., Scheurmann, P.: Implicit data structure for linear hashing schemes. Inf. Proc. Letters\u00a029, 183\u2013189 (1988)","journal-title":"Inf. Proc. Letters"},{"issue":"1","key":"14_CR16","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1093\/comjnl\/28.1.5","volume":"28","author":"N. Santoro","year":"1985","unstructured":"Santoro, N., Khatib, R.: Labelling and implicit routing in networks. Computer Journal\u00a028(1), 5\u20138 (1985)","journal-title":"Computer Journal"},{"key":"14_CR17","unstructured":"Talamo, M., Vocca, P.: A time optimal digraph browsing on a sparse representation. Technical Report 8, Math Department, University of Rome \"Tor Vergata\", Submitted to JGAA (1997)"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Turan, G.: Succint representation of graphs. Discrete Appl. Math.\u00a08, 289\u2013284 (1984)","DOI":"10.1016\/0166-218X(84)90126-4"},{"key":"14_CR19","series-title":"Handbook of Theoretical Computer Science","first-page":"525","volume-title":"Graph algorithms","year":"1990","unstructured":"van Leeuwen, J. (ed.): Graph algorithms. Handbook of Theoretical Computer Science, vol.\u00a0A, pp. 525\u2013631. Elsevier Science Publisher B.V., Amsterdam (1990)"},{"key":"14_CR20","volume-title":"The Book of L","author":"J. Leeuwen van","year":"1986","unstructured":"van Leeuwen, J., Tan, R.B.: Computer networks with compact routing tables. In: Rozenberg, G., Salomaa, A. (eds.) The Book of L, vol.\u00a0790. Springer, Heidelberg (1986)"},{"key":"14_CR21","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1093\/comjnl\/30.4.298","volume":"30","author":"J. Leeuwen van","year":"1987","unstructured":"van Leeuwen, J., Tan, R.B.: Interval routing. Computer Journal\u00a030, 298\u2013307 (1987)","journal-title":"Computer Journal"},{"key":"14_CR22","volume-title":"Proc. Colloquium on Structural Information and Communication Complexity (SICC 1994)","author":"J. Leeuwen van","year":"1994","unstructured":"van Leeuwen, J., Tan, R.B.: Compact routing methods: A survey. In: Proc. Colloquium on Structural Information and Communication Complexity (SICC 1994). Carleton University Press, Ottawa (1994)"},{"issue":"6","key":"14_CR23","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/BF01185207","volume":"12","author":"J.S. Vitter","year":"1994","unstructured":"Vitter, J.S., Shriver, E.A.M.: Algorithms for parallel memory, i: Two-level memories. Algorithmica\u00a012(6), 110\u2013147 (1994)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10692760_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T21:39:46Z","timestamp":1578519586000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10692760_14"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540651956","9783540494942"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/10692760_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}