2503 search results - page 68 / 501 » A study of 3-arc graphs |
177
click to vote
ICDE
2012
IEEE
13 years 8 months ago
2012
IEEE
—There is increasing interest in analyzing networks of all types including social, biological, sensor, computer, and transportation networks. Broadly speaking, we may be interest...
145
Voted
KDD
2007
ACM
16 years 6 months ago
2007
ACM
In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in seve...
161
Voted
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
In this paper, we study efficient closed pattern mining in a general framework of set systems, which are families of subsets ordered by set-inclusion with a certain structure, pro...
187
click to vote
LATIN
2010
Springer
16 years 24 days ago
2010
Springer
Topological self-stabilization is an important concept to build robust open distributed systems (such as peer-to-peer systems) where nodes can organize themselves into meaningful n...
133
click to vote
ICALP
2007
Springer
16 years 3 days ago
2007
Springer
We study the problem of finding occurrences of motifs in vertex-colored graphs, where a motif is a multiset of colors, and an occurrence of a motif is a subset of connected vertic...