3267 search results - page 161 / 654 » Generalized quasirandom graphs |
141
click to vote
ATAL
2005
Springer
15 years 10 months ago
2005
Springer
2. THE MASM ALGORITHM An input to the MASM algorithm is a time-annotated multi-agent action sequence. The action sequence is then transformed into an action graph. An action graph ...
143
click to vote
SIGMOD
2010
ACM
15 years 9 months ago
2010
ACM
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
134
click to vote
SODA
2004
ACM
15 years 6 months ago
2004
ACM
We solve an open problem posed by Eppstein in 1995 [14, 15] and re-enforced by Grohe [16, 17] concerning locally bounded treewidth in minor-closed families of graphs. A graph has ...
140
click to vote
ICML
2009
IEEE
16 years 5 months ago
2009
IEEE
We present a unified framework for learning link prediction and edge weight prediction functions in large networks, based on the transformation of a graph's algebraic spectru...
192
click to vote
SCALESPACE
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. In this paper, an adaptation of the eikonal equation is proposed by considering the latter on weighted graphs of arbitrary structure. This novel approach is based on a fa...