592 search results - page 77 / 119 » Crossing numbers of random graphs |
154
click to vote
CIKM
2009
Springer
16 years 4 days ago
2009
Springer
We consider the problem of releasing a limited public view of a sensitive graph which reveals at least k edges per node. We are motivated by Facebook’s public search listings, w...
168
click to vote
INFOCOM
2007
IEEE
15 years 12 months ago
2007
IEEE
— Recently, research on disconnected networks has been fostered by several studies on delay-tolerant networks, which are designed in order to sustain disconnected operations. We ...
170
click to vote
WEA
2010
Springer
15 years 10 months ago
2010
Springer
Maximizing the quality index modularity has become one of the primary methods for identifying the clustering structure within a graph. As contemporary networks are not static but e...
159
click to vote
SAC
2010
ACM
16 years 12 days ago
2010
ACM
Co-citation (number of nodes linking to both of a given pair of nodes) is often used heuristically to judge similarity between nodes in a complex network. We investigate the relat...
170
click to vote
DAM
2000
15 years 5 months ago
2000
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...