{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:31:14Z","timestamp":1750221074872,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":8,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,23]],"date-time":"2018-07-23T00:00:00Z","timestamp":1532304000000},"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":[[2018,7,23]]},"DOI":"10.1145\/3230718.3232112","type":"proceedings-article","created":{"date-parts":[[2018,7,13]],"date-time":"2018-07-13T16:08:49Z","timestamp":1531498129000},"page":"172-173","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["APF"],"prefix":"10.1145","author":[{"given":"Jinghan","family":"Zhou","sequence":"first","affiliation":[{"name":"Tsinghua University"}]},{"given":"Danyang","family":"Li","sequence":"additional","affiliation":[{"name":"Tsinghua University"}]},{"given":"Xiaohe","family":"Hu","sequence":"additional","affiliation":[{"name":"Tsinghua University"}]},{"given":"Yan","family":"Sun","sequence":"additional","affiliation":[{"name":"Huawei Technologies"}]},{"given":"Shui","family":"Cao","sequence":"additional","affiliation":[{"name":"Huawei Technologies"}]},{"given":"Wei","family":"Xu","sequence":"additional","affiliation":[{"name":"Huawei Technologies"}]},{"given":"Jun","family":"Li","sequence":"additional","affiliation":[{"name":"Tsinghua University and Beijing National Research Center for Information Science and Technology"}]}],"member":"320","published-online":{"date-parts":[[2018,7,23]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"The Internet Topology Zoo. http:\/\/www.topology-zoo.org\/dataset.html.  The Internet Topology Zoo. http:\/\/www.topology-zoo.org\/dataset.html."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49052-6_4"},{"key":"e_1_3_2_1_3_1","unstructured":"Thomas H Cormen Charles E Leiserson and Ronald L Rivest. 1990. The floyd-warshall algorithm. Introduction to Algorithms (1990) 558--565.  Thomas H Cormen Charles E Leiserson and Ronald L Rivest. 1990. The floyd-warshall algorithm. Introduction to Algorithms (1990) 558--565."},{"key":"e_1_3_2_1_4_1","unstructured":"Peyman Kazemian George Varghese and NickMcKeown. 2012. Header Space Analysis: Static Checking for Networks. In NSDI.   Peyman Kazemian George Varghese and NickMcKeown. 2012. Header Space Analysis: Static Checking for Networks. In NSDI."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2377677.2377766"},{"key":"e_1_3_2_1_6_1","unstructured":"Nuno P. Lopes Nikolaj Bj\u00f8rner Patrice Godefroid Karthick Jayaraman and George Varghese. 2015. Checking Beliefs in Dynamic Networks. In NSDI.   Nuno P. Lopes Nikolaj Bj\u00f8rner Patrice Godefroid Karthick Jayaraman and George Varghese. 2015. Checking Beliefs in Dynamic Networks. In NSDI."},{"volume-title":"Real-Time Verification of Network Properties Using Atomic Predicates. 2013 21st IEEE International Conference on Network Protocols (ICNP)","year":"2013","author":"Yang Hongkun","key":"e_1_3_2_1_7_1"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2013.2253121"}],"event":{"name":"ANCS '18: Symposium on Architectures for Networking and Communications Systems","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication","SIGARCH ACM Special Interest Group on Computer Architecture","IEEE CS"],"location":"Ithaca New York","acronym":"ANCS '18"},"container-title":["Proceedings of the 2018 Symposium on Architectures for Networking and Communications Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3230718.3232112","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3230718.3232112","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:57:30Z","timestamp":1750208250000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3230718.3232112"}},"subtitle":["fast network all-pair reachability calculation"],"short-title":[],"issued":{"date-parts":[[2018,7,23]]},"references-count":8,"alternative-id":["10.1145\/3230718.3232112","10.1145\/3230718"],"URL":"https:\/\/doi.org\/10.1145\/3230718.3232112","relation":{},"subject":[],"published":{"date-parts":[[2018,7,23]]},"assertion":[{"value":"2018-07-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}