{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:21:14Z","timestamp":1725549674050},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540281016"},{"type":"electronic","value":"9783540317111"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11534273_26","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T13:31:47Z","timestamp":1268400707000},"page":"294-305","source":"Crossref","is-referenced-by-count":1,"title":["A Dynamic Implicit Adjacency Labelling Scheme for Line Graphs"],"prefix":"10.1007","author":[{"given":"David","family":"Morgan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","unstructured":"Muller, J.H.: Local structure in graph classes. PhD thesis, Georgia Institute of Technology (1988)"},{"key":"26_CR2","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 J. on Discrete Mathematics\u00a05, 596\u2013603 (1992)","journal-title":"SIAM J. on Discrete Mathematics"},{"key":"26_CR3","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s00446-002-0073-5","volume":"16","author":"C. Gavoille","year":"2003","unstructured":"Gavoille, C., Peleg, D.: Compact and localized distributed data structures. J. of Distributed Computing\u00a016, 111\u2013120 (2003)","journal-title":"J. of Distributed Computing"},{"key":"26_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/3-540-44612-5_53","volume-title":"Mathematical Foundations of Computer Science 2000","author":"D. Peleg","year":"2000","unstructured":"Peleg, D.: Informative labeling schemes for graphs. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol.\u00a01893, pp. 579\u2013588. Springer, Heidelberg (2000)"},{"key":"26_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-540-39658-1_25","volume-title":"Algorithms - ESA 2003","author":"C. Gavoille","year":"2003","unstructured":"Gavoille, C., Paul, C.: Optimal distance labeling for interval and circular-arc graphs. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 254\u2013265. Springer, Heidelberg (2003)"},{"key":"26_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/3-540-46784-X_5","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"D. Peleg","year":"1999","unstructured":"Peleg, D.: Proximity-preserving labeling schemes and their applications. In: Widmayer, P., Neyer, G., Eidenbenz, S. (eds.) WG 1999. LNCS, vol.\u00a01665, pp. 30\u201341. Springer, Heidelberg (1999)"},{"key":"26_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/3-540-44634-6_23","volume-title":"Algorithms and Data Structures","author":"H. Kaplan","year":"2001","unstructured":"Kaplan, H., Milo, T.: Short and simple labels for small distances and other functions. In: Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 2001. LNCS, vol.\u00a02125, pp. 246\u2013257. Springer, Heidelberg (2001)"},{"key":"26_CR8","first-page":"547","volume-title":"Proc. 12 t h ACM-SIAM Symp. on Discrete Algorithms","author":"S. Abiteboul","year":"2001","unstructured":"Abiteboul, S., Kaplan, H., Milo, T.: Compact labeling schemes for ancestor queries. In: Proc. 12 t h ACM-SIAM Symp. on Discrete Algorithms, pp. 547\u2013556. ACM, New York (2001)"},{"key":"26_CR9","first-page":"258","volume-title":"Proc. 14 th ACM Symp. on Parallel Algorithms and Architectures","author":"S. Alstrup","year":"2002","unstructured":"Alstrup, S., Gavoille, C., Kaplan, H., Rauhe, T.: Nearest common ancestors: A survey and a new distributed algorithm. In: Proc. 14 th ACM Symp. on Parallel Algorithms and Architectures, pp. 258\u2013264. ACM, New York (2002)"},{"key":"26_CR10","first-page":"1","volume-title":"Proc. 13 th ACM Symp. on Parallel Algorithms and Architectures","author":"M. Thorup","year":"2001","unstructured":"Thorup, M., Zwick, U.: Compact routing schemes. In: Proc. 13 th ACM Symp. on Parallel Algorithms and Architectures, pp. 1\u201310. ACM, New York (2001)"},{"key":"26_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/3-540-48447-7_34","volume-title":"Algorithms and Data Structures","author":"G.S. Brodal","year":"1999","unstructured":"Brodal, G.S., Fagerberg, R.: Dynamic representation of sparse graphs. In: Dehne, F., Gupta, A., Sack, J.-R., Tamassia, R. (eds.) WADS 1999. LNCS, vol.\u00a01663, pp. 342\u2013351. Springer, Heidelberg (1999)"},{"key":"26_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/3-540-45061-0_31","volume-title":"Automata, Languages and Programming","author":"A. Korman","year":"2003","unstructured":"Korman, A., Peleg, D.: Labelling schemes for weighted dynamic trees. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 369\u2013383. Springer, Heidelberg (2003)"},{"key":"26_CR13","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s00224-003-1106-6","volume":"37","author":"A. Korman","year":"2004","unstructured":"Korman, A., Peleg, D., Rodeh, Y.: Labeling schemes for dynamic tree networks. Theory of Computing Systems\u00a037, 49\u201375 (2004)","journal-title":"Theory of Computing Systems"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Cohen, E., Kaplan, H., Milo, T.: Labeling dynamic XML trees. In: Proc. 21st ACM Symp. on Principles of Database Systems, pp. 271\u2013281 (2002)","DOI":"10.1145\/543613.543648"},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"Branst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. In: SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia (1999)","DOI":"10.1137\/1.9780898719796"},{"key":"26_CR16","doi-asserted-by":"publisher","first-page":"150","DOI":"10.2307\/2371086","volume":"54","author":"H. Whitney","year":"1932","unstructured":"Whitney, H.: Congruent graphs and the connectivity of graphs. American J. of Mathematics\u00a054, 150\u2013168 (1932)","journal-title":"American J. of Mathematics"},{"key":"26_CR17","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1145\/321850.321853","volume":"21","author":"P.G.H. Lehot","year":"1974","unstructured":"Lehot, P.G.H.: An optimal algorithm to detect a line graph and output its root graph. J. of the ACM\u00a021, 569\u2013575 (1974)","journal-title":"J. of the ACM"},{"key":"26_CR18","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/0020-0190(73)90029-X","volume":"2","author":"N.D. Roussopoulos","year":"1973","unstructured":"Roussopoulos, N.D.: A max{m, n} algorithm for determining the graph H from its line graph G. Information Processing Letters\u00a02, 108\u2013112 (1973)","journal-title":"Information Processing Letters"},{"key":"26_CR19","doi-asserted-by":"crossref","unstructured":"Spinrad, J.: Efficient Graph Representation. In: Fields Institute Monographs. AMS, Providence (2003)","DOI":"10.1090\/fim\/019"},{"key":"26_CR20","unstructured":"Morgan, D.: Useful names for vertices: An introduction to dynamic implicit informative labelling schemes. Technical Report TR05-04, Dept. of Computing Science, University of Alberta (2005)"},{"key":"26_CR21","doi-asserted-by":"crossref","unstructured":"Morgan, D.: A dynamic implicit adjacency labelling scheme for line graphs. Technical Report TR05-03, Dept. of Computing Science, University of Alberta (2005)","DOI":"10.1007\/11534273_26"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11534273_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:09:57Z","timestamp":1605643797000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11534273_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540281016","9783540317111"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11534273_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}