✦ LIBER ✦

Periodic subgraph mining in dynamic networks

✍ Scribed by Mayank Lahiri; Tanya Y. Berger-Wolf

Book ID: 106280469
Publisher: Springer-Verlag
Year: 2009
Tongue: English
Weight: 903 KB
Volume: 24
Category: Article
ISSN: 0219-1377
DOI: 10.1007/s10115-009-0253-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient algorithms for the periodic su

Efficient algorithms for the periodic subgraphs mining problem

✍ Apostolico, Alberto; Erdős, Péter L.; Győri, Ervin; Lipták, Zsuzsanna; Pizzi, Ci 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 180 KB

Dynamic detection of subgraphs in comput

Dynamic detection of subgraphs in computer networks

✍ Israel Cidon; Inder S. Gopal 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 990 KB

Community Evolution Mining in Dynamic So

Community Evolution Mining in Dynamic Social Networks

✍ Mansoureh Takaffoli; Farzad Sangi; Justin Fagnan; Osmar R. Zäıane 📂 Article 📅 2011 🏛 Elsevier 🌐 English ⚖ 281 KB

Dynamic periodic location area update in

Dynamic periodic location area update in mobile networks

✍ Yi-Bing Lin; Pei-Chun Lee; Chlamtac, I. 📂 Article 📅 2002 🏛 IEEE 🌐 English ⚖ 493 KB

Subgraph centrality and clustering in co

Subgraph centrality and clustering in complex hyper-networks

✍ Ernesto Estrada; Juan A. Rodríguez-Velázquez 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 255 KB

The representation of complex systems as networks is inappropriate for the study of certain problems. We show several examples of social, biological, ecological and technological systems where the use of complex networks gives very limited information about the structure of the system. Consequently,

Clustering of tag-induced subgraphs in c

Clustering of tag-induced subgraphs in complex networks

✍ Péter Pollner; Gergely Palla; Tamás Vicsek 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 559 KB