Searching for "Fast best-effort pattern matching in large attributed graphs." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

Fast best-effort pattern matching in large attributed graphs
by Hanghang Tong, Brian Gallagher, Christos Faloutsos, Tina Eliassi-rad — 2007 — In KDD
…ABSTRACT Fast Best-Effort Pattern Matching in Large Attributed Graphs Hanghang Tong † Brian…
Cited by 4 (4 self) – Add To MetaCart

Monitoring Proximity and Centrality on Time-Evolving Bipartite Graphs. SAM Special Issue on Best
by Hanghang Tong, Hanghang Tong, Spiros Papadimitriou, Philip S. Yu, Christos Faloutsos Fast, Hanghang Tong, Jingrui He, Mingjing Li, Wei-ying Ma, Hong-jiang Zhang, Jingrui He, Mingjing Li, Hong-jiang Zhang, Hanghang Tong, Changshui Zhang, Brian Gallagher, Hanghang Tong, Tina Eliassi-rad, Christos Faloutsos, Using Ghost — 2008
… Faloutsos, and Tina Eliassi-Rad. Fast Best-Effort Pattern Match in Large Attributed Graphs. KDD2007…
Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB