97 citations · 229 across the 33 of their papers we have counts for
Showing 2011 · cs.DSShow all
2 papers · 2 filters
cs.DS2011
Experiments on Density-Constrained Graph Clustering
Robert Görke, Andrea Schumm, Dorothea Wagner
Clustering a graph means identifying internally dense subgraphs which are only sparsely interconnected. Formalizations of this notion lead to measures that quantify the quality of…
cs.DS2011
Efficient Algorithms for Distributed Detection of Holes and Boundaries in Wireless Networks
Dennis Schieferdecker, Markus Völker, Dorothea Wagner
We propose two novel algorithms for distributed and location-free boundary recognition in wireless sensor networks. Both approaches enable a node to decide autonomously whether it…