×
Log in
Upload File
Most Popular
Study
Business
Design
Technology
Travel
Explore all categories
The top documents tagged [nodes of g]
More NP-completeness Sipser 7.5 (pages 283-294). CS 311 Mount Holyoke College 2 NP’s hardest problems Definition 7.34: A language B is NP-complete if
213 views
1 k-anonymity in Graphs. 2 Methods based on k-anonymity k-candidate k-degree k-neighborhood k-automorphism Publishing Social Graphs
228 views
Yangjun Chen 1 Bipartite Graph 1.A graph G is bipartite if the node set V can be partitioned into two sets V 1 and V 2 in such a way that no nodes from
272 views
Fast Isocontouring For Improved Interactivity Chandrajit L. Bajaj Valerio Pascucci Daniel R. Schikore
214 views
2. Random Graphs The Erdös-Rényi models. Distinguish: –Equilibrium random networks –Nonequilibrium random networks
224 views
Minimum Spanning Trees
64 views
Graph Summarization with Bounded Error
58 views
1 Cooperative MIMO Paradigms for Cognitive Radio Networks Wei Chen & Liang Hong College of Engineering Tennessee State University Dr. Liang Hong
[email protected]
215 views
Flow in Network. Graph, oriented graph, network A graph G =(V, E) is specified by a non empty set of nodes V and a set of edges E such that each edge
216 views
1 The Minimum Spanning Tree Problem Distributing Prim’s and Kruskal’s Algorithm
229 views
Fast Isocontouring For Improved Interactivity
21 views
Yannis Tzitzikas, Christina Lantzaki and Dimitris Zeginis Institute of Computer Science, FORTH-ICS, and Computer Science Department, University of Crete,
221 views
< Prev