{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:17:02Z","timestamp":1759133822266},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540669043"},{"type":"electronic","value":"9783540466482"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46648-7_10","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T08:29:28Z","timestamp":1186907368000},"page":"98-106","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":31,"title":["Graph Clustering Using Distance-k Cliques"],"prefix":"10.1007","author":[{"given":"Jubin","family":"Edachery","sequence":"first","affiliation":[]},{"given":"Arunabha","family":"Sen","sequence":"additional","affiliation":[]},{"given":"Franz J.","family":"Brandenburg","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,3,3]]},"reference":[{"key":"10_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/3-540-63938-1_59","volume-title":"Proceedings of Graph Drawing Symposium, GD\u201997","author":"F. J. Brandenburg","year":"1997","unstructured":"F. J. Brandenburg, \u201cGraph Clustering: Circles of Cliques,\u201d Proceedings of Graph Drawing Symposium, GD\u201997 Rome, September 1997. Lecture Notes in Computer Science, Berlin: Springer-Verlag, 1353, pp. 158\u2013168, 1998."},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0020-0190(97)81663-8","volume":"61","author":"J. S. Deogun","year":"1997","unstructured":"J. S. Deogun, D. Kratsch and G. Steiner, \u201cAn approximation algorithm for clustering graphs with dominating diametral paths,\u201d Information Processing Letters, 61, pp. 121\u2013127, 1997.","journal-title":"Information Processing Letters"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"P. Eades, \u201cMultilevel Visualization of Clustered Graphs,\u201d Proceedings of Graph Drawing\u201996, Berkeley, California, September,1996.","DOI":"10.1007\/3-540-62495-3_41"},{"key":"10_CR4","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1978","unstructured":"M. R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman Publishers, San Francisco, 1978."},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1145\/2402.322385","volume":"30","author":"D. W. Matula","year":"1983","unstructured":"D. W. Matula and L.L. Beck, \u201cSmallest-last ordering and clustering and graph coloring algorithms,\u201d Journal of the Association of Computing Machinery 30 pp. 417\u2013427, 1983.","journal-title":"Journal of the Association of Computing Machinery"},{"key":"10_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/3-540-63938-1_71","volume-title":"Proceedings of Graph Drawing Symposium, GD\u201997","author":"T. Roxborough","year":"1997","unstructured":"T. Roxborough and A. Sen, \u201cGraph clustering using multiway ratio cut,\u201d Proceedings of Graph Drawing Symposium, GD\u201997 Rome, September 1997. Lecture Notes in Computer Science, Berlin: Springer-Verlag, 1353, pp. 291\u2013296, 1998."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46648-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T17:14:55Z","timestamp":1585934095000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46648-7_10"}},"subtitle":["Software Demonstration"],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540669043","9783540466482"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-46648-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"3 March 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}