Csr2011 june16 16_30_golovach
Measuring Proximity in Networks
The role of compatibility in the diffusion of technologies in social networks Mohammad Mahdian Yahoo! Research Joint work with N. Immorlica, J. Kleinberg,
Kdd09
Node Cluster
Degree-3 Treewidth Sparsifiers Chandra Chekuri Julia Chuzhoy Univ. of IllinoisTTI Chicago.
1 Node Clustering in Wireless Sensor Networks by Considering Structural Characteristics of the Network Graph Nikos Dimokas 1 Dimitrios Katsaros 1,2 Yannis.
ELEC692 VLSI Signal Processing Architecture Lecture 4 Unfolding.
Internally Disjoint Paths Internally Disjoint Paths : Two paths u to v are internally disjoint if they have no common internal vertex.
Computational Geometry Seminar Lecture 1 Drawing Planar Graphs.
1 The Geodesic Broadcast Scheme for Wireless Ad Hoc Networks Dimitrios Katsaros, Ph.D. Yannis Manolopoulos, prof. @ Dept. Informatics Aristotle University,
Carthagène
