{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:30:13Z","timestamp":1750221013912,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,7,23]],"date-time":"2019-07-23T00:00:00Z","timestamp":1563840000000},"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,7,23]]},"DOI":"10.1145\/3335783.3335802","type":"proceedings-article","created":{"date-parts":[[2019,8,2]],"date-time":"2019-08-02T12:17:07Z","timestamp":1564748227000},"page":"185-188","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Graph Ordering and Clustering"],"prefix":"10.1145","author":[{"given":"Anna","family":"Beer","sequence":"first","affiliation":[{"name":"LMU Munich, Munich, Germany"}]},{"given":"Thomas","family":"Seidl","sequence":"additional","affiliation":[{"name":"LMU Munich, Munich, Germany"}]}],"member":"320","published-online":{"date-parts":[[2019,7,23]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/2034063.2034079"},{"key":"e_1_3_2_1_2_1","volume-title":"Graphs Drawing through Fuzzy Clustering. arXiv preprint arXiv: 1603.07011","author":"Ashouri Mohammadreza","year":"2016","unstructured":"Mohammadreza Ashouri , Ali Golshani , Dara Moazzmi , and Mandana Ghasemi . 2016. Graphs Drawing through Fuzzy Clustering. arXiv preprint arXiv: 1603.07011 ( 2016 ). Mohammadreza Ashouri, Ali Golshani, Dara Moazzmi, and Mandana Ghasemi. 2016. Graphs Drawing through Fuzzy Clustering. arXiv preprint arXiv: 1603.07011 (2016)."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30559-0_28"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/800195.805928"},{"volume-title":"Exploratory social network analysis with Pajek","author":"Nooy Wouter De","key":"e_1_3_2_1_6_1","unstructured":"Wouter De Nooy , Andrej Mrvar , and Vladimir Batagelj . 2011. Exploratory social network analysis with Pajek . Vol. 27 . Cambridge University Press . Wouter De Nooy, Andrej Mrvar, and Vladimir Batagelj. 2011. Exploratory social network analysis with Pajek. Vol. 27. Cambridge University Press."},{"key":"e_1_3_2_1_7_1","unstructured":"Chris Ding Xiaofeng He Hongyuan Zha Ming Gu and Horst Simon. 2001. Spectral min-max cut for graph partitioning and data clustering. (2001).  Chris Ding Xiaofeng He Hongyuan Zha Ming Gu and Horst Simon. 2001. Spectral min-max cut for graph partitioning and data clustering. (2001)."},{"key":"e_1_3_2_1_8_1","volume-title":"International Symposium on Graph Drawing. Springer, 92--100","author":"Do\u011frus\u00f6z U\u011fur","year":"1996","unstructured":"U\u011fur Do\u011frus\u00f6z , Brendan Madden , and Patrick Madden . 1996 . Circular layout in the graph layout toolkit . In International Symposium on Graph Drawing. Springer, 92--100 . U\u011fur Do\u011frus\u00f6z, Brendan Madden, and Patrick Madden. 1996. Circular layout in the graph layout toolkit. In International Symposium on Graph Drawing. Springer, 92--100."},{"key":"e_1_3_2_1_9_1","volume-title":"Algebraic connectivity of graphs. Czechoslovak mathematical journal 23, 2","author":"Fiedler Miroslav","year":"1973","unstructured":"Miroslav Fiedler . 1973. Algebraic connectivity of graphs. Czechoslovak mathematical journal 23, 2 ( 1973 ), 298--305. Miroslav Fiedler. 1973. Algebraic connectivity of graphs. Czechoslovak mathematical journal 23, 2 (1973), 298--305."},{"key":"e_1_3_2_1_10_1","volume-title":"Clustering by passing messages between data points. science 315, 5814","author":"Frey Brendan J","year":"2007","unstructured":"Brendan J Frey and Delbert Dueck . 2007. Clustering by passing messages between data points. science 315, 5814 ( 2007 ), 972--976. Brendan J Frey and Delbert Dueck. 2007. Clustering by passing messages between data points. science 315, 5814 (2007), 972--976."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/368996.369025"},{"volume-title":"The Stanford GraphBase: a platform for combinatorial computing","author":"Knuth Donald Ervin","key":"e_1_3_2_1_12_1","unstructured":"Donald Ervin Knuth . 1993. The Stanford GraphBase: a platform for combinatorial computing . Vol. 37 . Addison-Wesley Reading . Donald Ervin Knuth. 1993. The Stanford GraphBase: a platform for combinatorial computing. Vol. 37. Addison-Wesley Reading."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056489"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207168808803629"},{"key":"e_1_3_2_1_15_1","volume-title":"Labor dispute reconciliation in a forest products manufacturing facility. Forest products journal 47, 11\/12","author":"Michael Judd H","year":"1997","unstructured":"Judd H Michael . 1997. Labor dispute reconciliation in a forest products manufacturing facility. Forest products journal 47, 11\/12 ( 1997 ), 41. Judd H Michael. 1997. Labor dispute reconciliation in a forest products manufacturing facility. Forest products journal 47, 11\/12 (1997), 41."},{"key":"e_1_3_2_1_16_1","volume-title":"Fast algorithm for detecting community structure in networks. Physical review E 69, 6","author":"Newman Mark EJ","year":"2004","unstructured":"Mark EJ Newman . 2004. Fast algorithm for detecting community structure in networks. Physical review E 69, 6 ( 2004 ), 066133. Mark EJ Newman. 2004. Fast algorithm for detecting community structure in networks. Physical review E 69, 6 (2004), 066133."},{"key":"e_1_3_2_1_17_1","volume-title":"The 2012 International Joint Conference on. IEEE, 1--8.","author":"Paredes Gonzalo E","year":"2012","unstructured":"Gonzalo E Paredes and Luis S Vargas . 2012 . Circle-Clustering: A new heuristic partitioning method for the clustering problem. In Neural Networks (IJCNN) , The 2012 International Joint Conference on. IEEE, 1--8. Gonzalo E Paredes and Luis S Vargas. 2012. Circle-Clustering: A new heuristic partitioning method for the clustering problem. In Neural Networks (IJCNN), The 2012 International Joint Conference on. IEEE, 1--8."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.868688"},{"key":"e_1_3_2_1_19_1","volume-title":"Structure and dynamics of the global economy: network analysis of international trade 1965-1980. Social forces 70, 4","author":"Smith David A","year":"1992","unstructured":"David A Smith and Douglas R White . 1992. Structure and dynamics of the global economy: network analysis of international trade 1965-1980. Social forces 70, 4 ( 1992 ), 857--893. David A Smith and Douglas R White. 1992. Structure and dynamics of the global economy: network analysis of international trade 1965-1980. Social forces 70, 4 (1992), 857--893."},{"key":"e_1_3_2_1_20_1","volume-title":"Proceedings Ninth IEEE International Conference on Computer Vision. IEEE, 313","author":"Yu Stella X","year":"2003","unstructured":"X Yu Stella and Jianbo Shi . 2003 . Multiclass spectral clustering . In Proceedings Ninth IEEE International Conference on Computer Vision. IEEE, 313 . X Yu Stella and Jianbo Shi. 2003. Multiclass spectral clustering. In Proceedings Ninth IEEE International Conference on Computer Vision. IEEE, 313."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-007-9033-z"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1963.10500845"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915220"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1086\/jar.33.4.3629752"}],"event":{"name":"SSDBM '19: 31st International Conference on Scientific and Statistical Database Management","acronym":"SSDBM '19","location":"Santa Cruz CA USA"},"container-title":["Proceedings of the 31st International Conference on Scientific and Statistical Database Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3335783.3335802","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3335783.3335802","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:26:09Z","timestamp":1750206369000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3335783.3335802"}},"subtitle":["A Circular Approach"],"short-title":[],"issued":{"date-parts":[[2019,7,23]]},"references-count":24,"alternative-id":["10.1145\/3335783.3335802","10.1145\/3335783"],"URL":"https:\/\/doi.org\/10.1145\/3335783.3335802","relation":{},"subject":[],"published":{"date-parts":[[2019,7,23]]},"assertion":[{"value":"2019-07-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}