592 search results - page 77 / 119 » Crossing numbers of random graphs |
CIKM
2009
Springer
14 years 2 months 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...
INFOCOM
2007
IEEE
14 years 2 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 ...
WEA
2010
Springer
14 years 1 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...
SAC
2010
ACM
14 years 2 months 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...
DAM
2000
13 years 7 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...