2304 search results - page 111 / 461 » On the Vulnerability of Large Graphs |
158
click to vote
GD
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. This paper describes a system for Graph dRawing with Intelligent Placement, GRIP. The GRIP system is designed for drawing large graphs and uses a novel multi-dimensional ...
155
click to vote
COMBINATORICS
2007
15 years 6 months ago
2007
Let µ (G) and µmin (G) be the largest and smallest eigenvalues of the adjacency matrix of a graph G. Our main results are: (i) If H is a proper subgraph of a connected graph G o...
164
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
A k-frugal colouring of a graph G is a proper colouring of the vertices of G such that no colour appears more than k times in the neighbourhood of a vertex. This type of colouring...
150
click to vote
IMCSIT
2010
15 years 28 days ago
2010
We formulate a novel problem of summarising entities with limited presentation budget on entity-relationship knowledge graphs and propose an efficient algorithm for solving this pr...
140
click to vote
DEXAW
1999
IEEE
15 years 10 months ago
1999
IEEE
Internet systems provide a variety of ways to exchange information, contain large amounts and variety of data, and have become quite complex, making them vulnerable to attacks fro...