Sciweavers

3471 search results - page 126 / 695
» Obstacle Numbers of Graphs
Sort
View
COMBINATORICS
2006
97views more  COMBINATORICS 2006»
13 years 9 months ago
H-Free Graphs of Large Minimum Degree
We prove the following extension of an old result of Andr
Noga Alon, Benny Sudakov
SPAA
2000
ACM
14 years 2 months ago
Fault tolerant networks with small degree
In this paper, we study the design of fault tolerant networks for arrays and meshes by adding redundant nodes and edges. For a target graph G (linear array or mesh in this paper),...
Li Zhang
VIZSEC
2005
Springer
14 years 3 months ago
Multiple Coordinated Views for Network Attack Graphs
While efficient graph-based representations have been developed for modeling combinations of low-level network attacks, relatively little attention has been paid to effective tech...
Steven Noel, Michael Jacobs, Pramod Kalapa, Sushil...
HT
2010
ACM
13 years 11 months ago
Analysis of graphs for digital preservation suitability
We investigate the use of autonomically created small-world graphs as a framework for the long term storage of digital objects on the Web in a potentially hostile environment. We ...
Charles L. Cartledge, Michael L. Nelson
STOC
2002
ACM
99views Algorithms» more  STOC 2002»
14 years 10 months ago
Recognizing string graphs in NP
A string graph is the intersection graph of a set of curves in the plane. Each curve is represented by a vertex, and an edge between two vertices means that the corresponding curv...
Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic