{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:26:54Z","timestamp":1750220814775,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T00:00:00Z","timestamp":1569456000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,9,26]]},"DOI":"10.1145\/3351556.3351576","type":"proceedings-article","created":{"date-parts":[[2019,9,5]],"date-time":"2019-09-05T12:16:25Z","timestamp":1567685785000},"page":"1-3","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Complexity Aspects of Unstructured Sparse Graph Representation"],"prefix":"10.1145","author":[{"given":"Martin","family":"Neh\u00e9z","sequence":"first","affiliation":[{"name":"Institute of Information Engineering, Automation and Mathematics, Slovak University of Technology in Bratislava, Bratislava, Slovak Republic"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Bartalos","sequence":"additional","affiliation":[{"name":"Amadeus, Sophia-Antipolis, Valbonne, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,9,26]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"121","volume-title":"Bartalos: Effective Encoding and the Kolmogorov Complexity of the Internet. In Proc. of the Student Research Confernece, IIT.SRC 2006","author":"P.","year":"2006","unstructured":"P. Bartalos: Effective Encoding and the Kolmogorov Complexity of the Internet. In Proc. of the Student Research Confernece, IIT.SRC 2006 , SUT Publishing, Bratislava , pp. 121 -- 128 ( 2006 ) P. Bartalos: Effective Encoding and the Kolmogorov Complexity of the Internet. In Proc. of the Student Research Confernece, IIT.SRC 2006, SUT Publishing, Bratislava, pp. 121--128 (2006)"},{"key":"e_1_3_2_1_2_1","first-page":"361","volume-title":"Proc. of the 3rd Int. AAAI Conference on Weblogs and Social media, ICWSM 2009","author":"Bastian M.","year":"2009","unstructured":"M. Bastian , S. Heymann , M. Jacomy : Gephi: an open source software for exploring and manipulating networks . In Proc. of the 3rd Int. AAAI Conference on Weblogs and Social media, ICWSM 2009 , The AAAI Press , pp. 361 -- 362 ( 2009 ) M. Bastian, S. Heymann, M. Jacomy: Gephi: an open source software for exploring and manipulating networks. In Proc. of the 3rd Int. AAAI Conference on Weblogs and Social media, ICWSM 2009, The AAAI Press, pp. 361--362 (2009)"},{"key":"e_1_3_2_1_3_1","first-page":"679","volume-title":"Proc. of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2003, The ACM\/SIAM Press","author":"Blandford D. K.","year":"2003","unstructured":"D. K. Blandford , G. E. Blelloch , I. A. Kash : Compact representations of separable graphs . In Proc. of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2003, The ACM\/SIAM Press , pp. 679 -- 688 ( 2003 ) D. K. Blandford, G. E. Blelloch, I. A. Kash: Compact representations of separable graphs. In Proc. of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2003, The ACM\/SIAM Press, pp. 679--688 (2003)"},{"key":"e_1_3_2_1_4_1","first-page":"138","volume-title":"A. Farzan: Succinct Representations of Separable Graphs. In Proc. of the 21st Annual Symposium on Combinatorial Pattern Matching, CPM 2010, Springer, LNCS 6129","author":"Blelloch G. E.","year":"2010","unstructured":"G. E. Blelloch , A. Farzan: Succinct Representations of Separable Graphs. In Proc. of the 21st Annual Symposium on Combinatorial Pattern Matching, CPM 2010, Springer, LNCS 6129 , pp. 138 -- 150 ( 2010 ) G. E. Blelloch, A. Farzan: Succinct Representations of Separable Graphs. In Proc. of the 21st Annual Symposium on Combinatorial Pattern Matching, CPM 2010, Springer, LNCS 6129, pp. 138--150 (2010)"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","first-page":"1800","DOI":"10.1007\/978-3-319-77525-8_54","volume-title":"(Web\/Social) Graph Compression. Encyclopedia of Big Data Technologies","author":"Boldi P.","year":"2019","unstructured":"P. Boldi , S. Vigna : (Web\/Social) Graph Compression. Encyclopedia of Big Data Technologies (S. Sakr and A. Y. Zomaya eds.), Springer , pp. 1800 -- 1804 ( 2019 ) P. Boldi, S. Vigna: (Web\/Social) Graph Compression. Encyclopedia of Big Data Technologies (S. Sakr and A. Y. Zomaya eds.), Springer, pp. 1800--1804 (2019)"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988752"},{"key":"e_1_3_2_1_7_1","first-page":"638","volume-title":"Proc. of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies INFOCOM 2002","author":"Bu T.","year":"2002","unstructured":"T. Bu , D. F. Towsley : On Distinguishing between Internet Power Law Topology Generators . In Proc. of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies INFOCOM 2002 , pp. 638 -- 647 ( 2002 ) T. Bu, D. F. Towsley: On Distinguishing between Internet Power Law Topology Generators. In Proc. of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies INFOCOM 2002, pp. 638--647 (2002)"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1841909.1841913"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.09.031"},{"key":"e_1_3_2_1_11_1","unstructured":"Inet Topology Generator. Download Web-page URL: http:\/\/topology.eecs.umich.edu\/inet\/  Inet Topology Generator. Download Web-page URL: http:\/\/topology.eecs.umich.edu\/inet\/"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032718","volume-title":"Rucinski: Random Graphs","author":"Janson S.","year":"2000","unstructured":"S. Janson , T. Luczak , A. Rucinski: Random Graphs . John Wiley & Sons , New York ( 2000 ) S. Janson, T. Luczak, A. Rucinski: Random Graphs. John Wiley & Sons, New York (2000)"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2606-0","volume-title":"Vit\u00e1nyi: An introduction to Kolmogorov complexity and its applications","author":"Li M.","year":"1997","unstructured":"M. Li , P. Vit\u00e1nyi: An introduction to Kolmogorov complexity and its applications ( 2 nd ed.). Springer-Verlag New York, Inc. , Secaucus, NJ, USA ( 1997 ) M. Li, P. Vit\u00e1nyi: An introduction to Kolmogorov complexity and its applications (2nd ed.). Springer-Verlag New York, Inc., Secaucus, NJ, USA (1997)","edition":"2"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511843747","volume-title":"A Guide to Experimental Algorithmics","author":"McGeoch C. C.","year":"2012","unstructured":"C. C. McGeoch : A Guide to Experimental Algorithmics . Cambridge University Press , New York ( 2012 ) C. C. McGeoch: A Guide to Experimental Algorithmics. Cambridge University Press, New York (2012)"},{"key":"e_1_3_2_1_15_1","first-page":"219","volume-title":"P. Bartalos: On Space Complexity of Sparse Graphs Representation. In Proc. of the 6th Conference on Applied Mathematics, APLIMAT 2007","author":"Neh\u00e9z M.","year":"2007","unstructured":"M. Neh\u00e9z , P. Bartalos: On Space Complexity of Sparse Graphs Representation. In Proc. of the 6th Conference on Applied Mathematics, APLIMAT 2007 , Dept. of Mathematics, Faculty of Mechanical Engineering, SUT, Bratislava, Part III , pp. 219 -- 226 ( 2007 ) M. Neh\u00e9z, P. Bartalos: On Space Complexity of Sparse Graphs Representation. In Proc. of the 6th Conference on Applied Mathematics, APLIMAT 2007, Dept. of Mathematics, Faculty of Mechanical Engineering, SUT, Bratislava, Part III, pp. 219--226 (2007)"},{"key":"e_1_3_2_1_16_1","volume-title":"Graphical Evolution","author":"Palmer E. M.","year":"1985","unstructured":"E. M. Palmer : Graphical Evolution . John Wiley & Sons, Inc. , New York ( 1985 ) E. M. Palmer: Graphical Evolution. John Wiley & Sons, Inc., New York (1985)"},{"key":"e_1_3_2_1_17_1","first-page":"405","volume-title":"H. Garcia-Molina: Representing Web Graphs. In Proc. of the 19th Int. Conference on Data Engineering, ICDE 2003, IEEE Computer Society","author":"Raghavan S.","year":"2003","unstructured":"S. Raghavan , H. Garcia-Molina: Representing Web Graphs. In Proc. of the 19th Int. Conference on Data Engineering, ICDE 2003, IEEE Computer Society , pp. 405 -- 416 ( 2003 ) S. Raghavan, H. Garcia-Molina: Representing Web Graphs. In Proc. of the 19th Int. Conference on Data Engineering, ICDE 2003, IEEE Computer Society, pp. 405--416 (2003)"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1290672.1290680"},{"key":"e_1_3_2_1_19_1","volume-title":"Theory of Recursive Functions and Effective Computability","author":"Jr H. J.","year":"1987","unstructured":"H. J. Rogers ( Jr .). : Theory of Recursive Functions and Effective Computability . MIT Press ( 1987 ) H. J. Rogers (Jr.).: Theory of Recursive Functions and Effective Computability. MIT Press (1987)"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/882454.875028"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.semcdb.2016.01.011"}],"event":{"name":"BCI'19: 9th Balkan Conference in Informatics","sponsor":["Technical University of Sofia"],"location":"Sofia Bulgaria","acronym":"BCI'19"},"container-title":["Proceedings of the 9th Balkan Conference on Informatics"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3351556.3351576","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3351556.3351576","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:13:03Z","timestamp":1750201983000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3351556.3351576"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,26]]},"references-count":20,"alternative-id":["10.1145\/3351556.3351576","10.1145\/3351556"],"URL":"https:\/\/doi.org\/10.1145\/3351556.3351576","relation":{},"subject":[],"published":{"date-parts":[[2019,9,26]]},"assertion":[{"value":"2019-09-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}