ипотпал: PrePrint: Efficient Algorithms for Summarizing Graph Patterns <b>...</b>

Агрегирано в 0:50 | неделя, 7 март 2010 г.

Ипотпал PrePrint: Efficient Algorithms for Summarizing Graph PatternsWe investigate the problem of summarizing frequent subgraphs by a smaller set of representative patterns. We show that some special graph patterns, called δ-jump ...

Ипотпал - http://ping.fm/kMXkp