Sciweavers

721 search results - page 43 / 145
» Almost universal graphs
Sort
View
127
Voted
PKDD
2000
Springer
159views Data Mining» more  PKDD 2000»
15 years 4 months ago
An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data
Abstract. This paper proposes a novel approach named AGM to eciently mine the association rules among the frequently appearing substructures in a given graph data set. A graph tran...
Akihiro Inokuchi, Takashi Washio, Hiroshi Motoda
90
Voted
JGT
2006
95views more  JGT 2006»
15 years 24 days ago
Maximal independent sets in graphs with at most r cycles
We find the maximum number of maximal independent sets in two families of graphs. The first family consists of all graphs with n vertices and at most r cycles. The second family i...
Goh Chee Ying, Koh Khee Meng, Bruce E. Sagan, Vinc...
100
Voted
CATS
2006
15 years 2 months ago
On the Logical Implication of Multivalued Dependencies with Null Values
The implication of multivalued dependencies (MVDs) in relational databases has originally been defined in the context of some fixed finite universe (Fagin 1977, Zaniolo 1976). Whi...
Sebastian Link
108
Voted
KDD
2007
ACM
154views Data Mining» more  KDD 2007»
16 years 1 months ago
An event-based framework for characterizing the evolutionary behavior of interaction graphs
Interaction graphs are ubiquitous in many fields such as bioinformatics, sociology and physical sciences. There have been many studies in the literature targeted at studying and m...
Sitaram Asur, Srinivasan Parthasarathy, Duygu Ucar
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
15 years 6 months ago
Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go?
In decision tree models, considerable attention has been paid on the effect of symmetry on computational complexity. That is, for a permutation group Γ, how low can the complexit...
Xiaoming Sun, Andrew Chi-Chih Yao, Shengyu Zhang