The top documents tagged [node v]

Drawings as Models of Syntactic Structure: Theory and Algorithms by Mathias Möhl supervised by Marco Kuhlmann final talk of diploma thesis at Programming
Documents Drawings as Models of Syntactic Structure: Theory and Algorithms by Mathias Möhl supervised by Marco Kuhlmann final talk of diploma thesis at Programming

219 views

Size-estimation framework with applications to transitive closure and reachability Presented by Maxim Kalaev Edith Cohen AT&T Bell Labs 1996
Documents Size-estimation framework with applications to transitive closure and reachability Presented by Maxim Kalaev Edith Cohen AT&T Bell Labs 1996

219 views

1 Constructing Splits Graphs Author: Andreas W.M. Dress Daniel H. Huson Presented by: Bakhtiyar Uddin
Documents 1 Constructing Splits Graphs Author: Andreas W.M. Dress Daniel H. Huson Presented by: Bakhtiyar Uddin

214 views

Spread of Influence through a Social Network Adapted from :
Documents Spread of Influence through a Social Network Adapted from :

216 views

Maximizing the Spread of Influence through a Social Network Authors: David Kempe, Jon Kleinberg, É va Tardos KDD 2003 Source: xiaonanz/Maximizing-the-Spread-of-Influence.ppt
Documents Maximizing the Spread of Influence through a Social Network Authors: David Kempe, Jon Kleinberg, É va Tardos KDD 2003 Source: xiaonanz/Maximizing-the-Spread-of-Influence.ppt

221 views

Constant Density Spanners for Wireless Ad hoc Networks Kishore Kothapalli (JHU) Melih Onus (ASU) Christian Scheideler (JHU) Andrea Richa (ASU) 1
Documents Constant Density Spanners for Wireless Ad hoc Networks Kishore Kothapalli (JHU) Melih Onus (ASU) Christian Scheideler (JHU) Andrea Richa (ASU) 1

221 views

On the Advantage of Overlapping Clustering for Minimizing Conductance Rohit Khandekar, Guy Kortsarz, and Vahab Mirrokni
Documents On the Advantage of Overlapping Clustering for Minimizing Conductance Rohit Khandekar, Guy Kortsarz, and Vahab Mirrokni

220 views

Data Structures and Algorithms Graphs Single-Source Shortest Paths (Dijkstra’s Algorithm) PLSD210(ii)
Documents Data Structures and Algorithms Graphs Single-Source Shortest Paths (Dijkstra’s Algorithm) PLSD210(ii)

246 views

Speaker: Ping-Lin Chang 2009/04/12. Introduction ROAD Framework Operation Designed Empirical Results Conclusions 2Fast Object Search on Road
Documents Speaker: Ping-Lin Chang 2009/04/12. Introduction ROAD Framework Operation Designed Empirical Results Conclusions 2Fast Object Search on Road

214 views

Graphs. Data structures that connect a set of objects to form a kind of a network Objects are called “Nodes” or “Vertices” Connections are called “Edges”
Documents Graphs. Data structures that connect a set of objects to form a kind of a network Objects are called “Nodes” or “Vertices” Connections are called “Edges”

218 views

1 Computer Group Engineering Department University of Science and Culture S. H. Davarpanah Davarpanah@usc.ac.ir
Documents 1 Computer Group Engineering Department University of Science and Culture S. H. Davarpanah [email protected]

215 views

Swarm Intelligence 05005028 (sarat chand) 05005029(naresh Kumar) 05005031(veeranjaneyulu) 05010033(kalyan raghu)
Documents Swarm Intelligence 05005028 (sarat chand) 05005029(naresh Kumar) 05005031(veeranjaneyulu) 05010033(kalyan raghu)

218 views