478 search results - page 11 / 96 » Structural Properties of Twin-Free Graphs |
PAKDD
2007
ACM
14 years 2 months ago
2007
ACM
In graph mining applications, there has been an increasingly strong urge for imposing user-specified constraints on the mining results. However, unlike most traditional itemset co...
WADS
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Algorithms or target functions for graph clustering rarely admit quality guarantees or optimal results in general. Based on properties of minimum-cut trees, a clustering ...
JGT
2010
13 years 7 months ago
2010
While finite cop-win finite graphs possess a good structural characterization, none is known for infinite cop-win graphs. As evidence that such a characterization might not exis...
AGTIVE
2003
Springer
14 years 1 months ago
2003
Springer
Graph-reduction specifications (GRSs) are a powerful new method for specifying classes of pointer data structures (shapes). They cover important shapes, like various forms of bal...
ACL
2010
13 years 6 months ago
2010
Wikipedia articles in different languages are connected by interwiki links that are increasingly being recognized as a valuable source of cross-lingual information. Unfortunately,...