4171 search results - page 137 / 835 » Choice numbers of graphs |
134
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
We prove the following extension of an old result of Andr
175
click to vote
SPAA
2000
ACM
15 years 11 months ago
2000
ACM
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),...
175
click to vote
VIZSEC
2005
Springer
16 years 8 hour ago
2005
Springer
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...
183
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
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...
157
click to vote
ICDM
2005
IEEE
16 years 4 days ago
2005
IEEE
Data mining algorithms are facing the challenge to deal with an increasing number of complex objects. For graph data, a whole toolbox of data mining algorithms becomes available b...