316 search results - page 11 / 64 » On almost self-complementary graphs |
WEA
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. The vertex cover problem is a classical NP-complete problem for which the best worst-case approximation ratio is 2− o(1). In this paper, we use a collection of simple g...
COCOON
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We present three streaming algorithms that ( , δ)− approximate 1 the number of triangles in graphs. Similar to the previous algorithms [3], the space usage of presente...
SG
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Bayesian nets (BNs) appeared in the 1980s as a solution to computational and representational problems encountered in knowledge representation of uncertain information. S...
GG
2004
Springer
14 years 2 months ago
2004
Springer
There would seem to be a natural connection between graphs and information security. This is particularly so in the arena of access control and authorization. Research on applying ...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...