#### Filter Results:

- Full text PDF available (5)

#### Publication Year

2011

2013

- This year (0)
- Last 5 years (5)
- Last 10 years (7)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Robert Görke, Andrea Schumm, Dorothea Wagner
- ALENEX
- 2012

Clustering a graph means identifying internally dense subgraphs that are only sparsely interconnected. Formalizations of this notion lead to measures that quantify the quality of a clustering and to algorithms that actually find clusterings. Since, most generally, corresponding optimization problems are hard, heuristic clustering algorithms are used in… (More)

- Reinhard Bauer, Gianlorenzo D'Angelo, Daniel Delling, Andrea Schumm, Dorothea Wagner
- J. Graph Algorithms Appl.
- 2012

We study a graph-augmentation problem arising from a technique applied in recent approaches for route planning. Many such methods enhance the graph by inserting shortcuts, i.e., additional edges (u,v) such that the length of (u,v) is the distance from u to v. Given a weighted, directed graph G and a number c ∈ Z>0, the shortcut problem asks how to insert c… (More)

- Robert Görke, Pascal Maillard, Andrea Schumm, Christian Staudt, Dorothea Wagner
- ACM Journal of Experimental Algorithmics
- 2013

Maximizing the quality index <i>modularity</i> has become one of the primary methods for identifying the clustering structure within a graph. Since many contemporary networks are not static but evolve over time, traditional static approaches can be inappropriate for specific tasks. In this work, we pioneer the NP-hard problem of online dynamic modularity… (More)

- Robert Görke, Andrea Schumm, Dorothea Wagner
- WADS
- 2011

- Christian Staudt, Andrea Schumm, Henning Meyerhenke, Robert Görke, Dorothea Wagner
- 2012 IEEE/ACM International Conference on…
- 2012

Collaboration networks arise when we map the connections between scientists which are formed through joint publications. These networks thus display the social structure of academia, and also allow conclusions about the structure of scientific knowledge. Using the computer science publication database DBLP, we compile relations between authors and… (More)

- Robert Görke, Roland Kluge, Andrea Schumm, Christian Staudt, Dorothea Wagner
- MedAlg
- 2012

A planted partition graph is an Erdős-Rényi type random graph, where, based on a given partition of the vertex set, vertices in the same part are linked with a higher probability than vertices in different parts. Graphs of this type are frequently used to evaluate graph clustering algorithms, i.e., algorithms that seek to partition the vertex set of a graph… (More)

In scientometrics, the quantitative study of science, network analysis has become a prominent tool. The kinds of networks most frequently examined have been citation networks (mapping links between publications based on references) and collaboration networks (mapping the collaborative relationships between researchers based on joint publications)… (More)

- ‹
- 1
- ›