2503 search results - page 30 / 501 » A study of 3-arc graphs |
ESWS
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. This paper studies the RDF model from a database perspective. From this point of view it is compared with other database models, particularly with graph database models, ...
WAW
2004
Springer
14 years 3 months ago
2004
Springer
In this paper we study the size of generalised dominating sets in two graph processes which are widely used to model aspects of the world-wide web. On the one hand, we show that gr...
JGT
2010
13 years 8 months ago
2010
We study vertex-colorings of plane graphs that do not contain a rainbow face, i.e., a face with vertices of mutually distinct colors. If G is a 3-connected plane graph with n vert...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Let X and Y be finite alphabets and PXY a joint distribution over them, with PX and PY representing the marginals. For any > 0, the set of n-length sequences xn and yn that ar...
ISAAC
2007
Springer
14 years 3 months ago
2007
Springer
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...