76 search results - page 9 / 16 » Judicious partitions of directed graphs |
134
Voted
KDD
2012
ACM
13 years 3 months ago
2012
ACM
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
76
Voted
ICDM
2008
IEEE
15 years 7 months ago
2008
IEEE
In graph mining, a frequency measure is anti-monotonic if the frequency of a pattern never exceeds the frequency of a subpattern. The efficiency and correctness of most graph pat...
115
Voted
IEEECIT
2009
IEEE
15 years 7 months ago
2009
IEEE
—Software clustering is a method for increasing software system understanding and maintenance. Software designers, first use MDG graph to model the structure of software system. ...
179
Voted
SIGMOD
2007
ACM
16 years 27 days ago
2007
ACM
Query processing over graph-structured data is enjoying a growing number of applications. Keyword search on a graph finds a set of answers, each of which is a substructure of the ...
99
Voted
TC
1998
15 years 11 days ago
1998
—Loop networks (or Hamiltonian circulant graphs) are a popular class of fault-tolerant network topologies which include rings and complete graphs. For this class, the fundamental...