https://algo.iti.kit.edu/ 2026-05-12T21:42:34+00:00 https://algo.iti.kit.edu/ https://algo.iti.kit.edu/_media/favicon.ico text/html 2011-03-11T16:50:04+00:00 Anonymous (anonymous@undisclosed.example.com) https://algo.iti.kit.edu/en/projects/spp1307/aims General Aims Graph clustering is a research area, which methods of algorithm engineering can contribute to decisively. Presumably, theoretical insights into formally and rigorously defined optimization problems in this field will only be of limited use, since they typically do not cover all relevant aspects of graph clustering. On the other hand, experimental results on specific applications or data sets are not sufficient for gaining consolidated findings that are valid beyond a fixed applica… text/html 2011-05-06T09:15:26+00:00 Anonymous (anonymous@undisclosed.example.com) https://algo.iti.kit.edu/en/projects/spp1307/dyneval Evaluation of Dynamic Clustering Algorithms This page offers supplementary information and data for our work concerning evaluation of design and analysis of algorithms for clustering dynamic graphs. The technical report on our studies can be found here: text/html 2011-11-18T17:08:32+00:00 Anonymous (anonymous@undisclosed.example.com) https://algo.iti.kit.edu/en/projects/spp1307/dyngen A Generator for Dynamic Clustered Random Graphs This page offers supplementary information on our random generator for graphs which are both dynamic and have an implanted clustering. Two versions of this generator exist, a full description of the original version including data structures, usage and background can be found in our text/html 2011-06-07T10:39:35+00:00 Anonymous (anonymous@undisclosed.example.com) https://algo.iti.kit.edu/en/projects/spp1307/emaildata Email Network of KIT Informatics Download The dataset can be downloaded from Tübingen's Graph Database: GraphDB Description (The following description is also enclosed in the download) Each line represents an email contact and looks similar to the following example: 2006-09-13 07:39:32;11;5;12;8;92530801 text/html 2011-05-06T12:11:16+00:00 Anonymous (anonymous@undisclosed.example.com) https://algo.iti.kit.edu/en/projects/spp1307/erster_berichtszeitraum Period of First Report For a list of publications regarding the first project phase please see the german page. text/html 2011-03-11T09:17:57+00:00 Anonymous (anonymous@undisclosed.example.com) https://algo.iti.kit.edu/en/projects/spp1307/index Clustering of Static and Temporal Graphs Project Members Dr. Tanja Hartmann, Dr. rer. nat. Robert Görke, Prof. Dr. Dorothea Wagner Funding Subproject of the Priority Programme 1307 Algorithm Engineering of the Deutsche Forschungsgemeinschaft (German Research Foundation). Summary As a result of the rapidly growing extent of electronically available data, methods for the localization of relevant information and their intelligent organization are of increasing importance. The field of algorit… text/html 2009-01-15T15:56:40+00:00 Anonymous (anonymous@undisclosed.example.com) https://algo.iti.kit.edu/en/projects/spp1307/publications State of the Art Among other things our previous work in this field encompasses the following publications. Publications * U. Brandes, M. Gaertler, D. Wagner. Engineering Graph Clustering: Models and Experimental Evaluation. ACM Journal of Experimental Algorithmics, 12(1.1):1-26, 2007. text/html 2011-05-06T12:11:51+00:00 Anonymous (anonymous@undisclosed.example.com) https://algo.iti.kit.edu/en/projects/spp1307/sidebar SPP 1307 * Summary * General Aims * State of the Art * Period of First Report * Period of Second Report * Dynamic Generators * Dynamic Evaluation * Static Generators * E-mail Dataset text/html 2011-05-06T12:13:16+00:00 Anonymous (anonymous@undisclosed.example.com) https://algo.iti.kit.edu/en/projects/spp1307/staticgen Static Graph Generators Among other tasks, we use systematic batches of random generated instances for the evaluation of clustering algorithms. Arguably, the relevance or realism of many random models such as Erdos-Renyi-type graphs can be questioned, however, the possibility to very clearly scale, parameterize and predict properties of such graphs render them valuable to understanding the behavior of an algorithm. text/html 2011-05-06T12:12:39+00:00 Anonymous (anonymous@undisclosed.example.com) https://algo.iti.kit.edu/en/projects/spp1307/zweiter_berichtszeitraum Period of Second Report For a list of publications regarding the second project phase please see the german page.