Reinhard Sablowski

  • Citations Per Year
Learn More
We present a technique and a program for the automatic clustering of graphs. The technique is based on several heuristics, which allows for an eecient implementation on a personal computer. Our approach is capable of clustering graphs with > 3000 vertices eeciently. The demonstration shows an interactive user environment that supports both automatic and(More)
  • 1