{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T06:00:55Z","timestamp":1783576855664,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540662792","type":"print"},{"value":"9783540484479","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48447-7_34","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T21:42:14Z","timestamp":1194990134000},"page":"342-351","source":"Crossref","is-referenced-by-count":34,"title":["Dynamic Representations of Sparse Graphs"],"prefix":"10.1007","author":[{"given":"Gerth St\u00f8lting","family":"Brodal","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rolf","family":"Fagerberg","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2002,7,18]]},"reference":[{"key":"34_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0166-218X(97)00007-3","volume":"78","author":"S. R. Arikati","year":"1997","unstructured":"Srinivasa R. Arikati, Anil Maheshwari, and Christos D. Zaroliagis. Efficient computation of implicit representations of sparse graphs. Discrete Applied Mathematics, 78:1\u201316, 1997.","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"34_CR2","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/BF01202467","volume":"10","author":"B. Chen","year":"1994","unstructured":"Boliong Chen, Makoto Matsumoto, Jian Fang Wang, Zhong Fu Zhang, and Jian Xun Zhang. A short proof of Nash-Williams\u2018theorem for the arboricity of a graph. Graphs Combin., 10(1):27\u201328, 1994.","journal-title":"Graphs Combin."},{"key":"34_CR3","doi-asserted-by":"crossref","unstructured":"Chuang, Garg, He, Kao, and Lu. Compact encodings of planar graphs via canonical orderings and multiple parentheses. In ICALP: Annual International Colloquium on Automata, Languages and Programming, 1998.","DOI":"10.1007\/BFb0055046"},{"key":"34_CR4","volume-title":"Introduction to Algorithms","author":"T. H. Cormen","year":"1990","unstructured":"Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to Algorithms, chapter 23. MIT Press, Cambridge, Mass., 1990."},{"issue":"3","key":"34_CR5","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1145\/828.1884","volume":"31","author":"M. L. Fredman","year":"1984","unstructured":"Michael L. Fredman, J\u00e1nos Koml\u00f3s, and Endre Szemer\u00e9di. Storing a sparse table with O(1) worst case access time. Journal of the Association for Computing Machinery, 31(3):538\u2013544, 1984.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"34_CR6","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/BF01758774","volume":"7","author":"H. N. Gabow","year":"1992","unstructured":"Harold N. Gabow and Herbert H. Westermann. Forests, frames, and games: Algorithms for matroid sums and applications. Algorithmica, 7:465\u2013497, 1992.","journal-title":"Algorithmica"},{"key":"34_CR7","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0166-218X(98)00007-9","volume":"84","author":"Grossi","year":"1998","unstructured":"Grossi and Lodi Simple planar graph partition into three forests. Discrete Applied Mathematics, 84:121\u2013132, 1998.","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"34_CR8","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1137\/0405049","volume":"5","author":"S. Kannan","year":"1992","unstructured":"Sampath Kannan, Moni Naor, and Steven Rudich. Implicit representation of graphs. SIAM Journal on Discrete Mathematics, 5(4):596\u2013603, 1992.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"34_CR9","doi-asserted-by":"crossref","unstructured":"Peter Bro Miltersen. Error correcting codes, perfect hashing circuits, and deterministic dynamic dictionaries. In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 556\u2013563, 1998.","DOI":"10.7146\/brics.v4i17.18813"},{"key":"34_CR10","doi-asserted-by":"crossref","unstructured":"J. Ian Munro and Venkatesh Raman. Succinct representation of balanced parentheses, static trees and planar graphs. In 38th Annual Symposium on Foundations of Computer Science, pages 118\u2013126, 20-22 October 1997.","DOI":"10.1109\/SFCS.1997.646100"},{"key":"34_CR11","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1112\/jlms\/s1-36.1.445","volume":"36","author":"C. St. J. A. Nash-Williams","year":"1961","unstructured":"C. St. J. A. Nash-Williams. Edge-disjoint spanning trees of finite graphs. The Journal of the London Mathematical Society, 36:445\u2013450, 1961.","journal-title":"The Journal of the London Mathematical Society"},{"key":"34_CR12","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1112\/jlms\/s1-39.1.12","volume":"39","author":"C. St. J. A. Nash-Williams","year":"1964","unstructured":"C. St. J. A. Nash-Williams. Decomposition of finite graphs into forests. The Journal of the London Mathematical Society, 39:12, 1964.","journal-title":"The Journal of the London Mathematical Society"},{"key":"34_CR13","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1002\/net.3230120206","volume":"12","author":"J. C. Picard","year":"1982","unstructured":"J. C. Picard and M. Queyranne. A network ow soloution to some non-linear 0-1 programming problems, with applications to graph theory. Networks, 12:141\u2013160, 1982.","journal-title":"Networks"},{"key":"34_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/10692760_14","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M. Talamo","year":"1998","unstructured":"M. Talamo and P. Vocca. Compact implicit representation of graphs. In Graph-Theoretic Concepts in Computer Science, volume 1517 of Lecture Notes in Computer Science, pages 164\u2013176, 1998."},{"key":"34_CR15","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0166-218X(84)90126-4","volume":"8","author":"G. Turan","year":"1984","unstructured":"G. Turan. Succinct representations of graphs. Discrete Applied Math, 8:289\u2013294, 1984.","journal-title":"Discrete Applied Math"},{"key":"34_CR16","first-page":"525","volume-title":"Handbook of Theoretical Computer Science, vol. A: Algorithms and Complexity","author":"J. Leeuwen van","year":"1990","unstructured":"Jan van Leeuwen. Graph algorithms. In Handbook of Theoretical Computer Science, vol. A: Algorithms and Complexity, pages 525\u2013631. North-Holland Publ. Comp., Amsterdam, 1990."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48447-7_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T08:28:44Z","timestamp":1737534524000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48447-7_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540662792","9783540484479"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-48447-7_34","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1999]]}}}