2304 search results - page 77 / 461 » On the Vulnerability of Large Graphs |
ISCIS
2005
Springer
15 years 5 months ago
2005
Springer
Dense subgraphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Computing them however is generally expe...
103
click to vote
ESCIENCE
2007
IEEE
15 years 3 months ago
2007
IEEE
Data sources, storage, computing resources and services are entities on Grids that require mechanisms for publication and lookup. A discovery service relies on efficient lookup to...
DM
2010
14 years 12 months ago
2010
For a graph G, denote by fk(G) the smallest number of vertices that must be deleted from G so that the remaining induced subgraph has its maximum degree shared by at least k verti...
113
click to vote
JSAC
2008
14 years 12 months ago
2008
Suppose we have a directed graph G with set of nodes V = {1, . . . , N} and a measure xi for every node i V . The average consensus problem consists in computing the average xA = ...
SIAMDM
2008
14 years 11 months ago
2008
For a real c 1 and an integer n, let f(n, c) denote the maximum integer f such that every graph on n vertices contains an induced subgraph on at least f vertices in which the max...