2283 search results - page 63 / 457 » Bounds of Graph Characteristics |
ESANN
2008
13 years 9 months ago
2008
Abstract. This paper introduces a new concept to the processing of graph structured information using self organising map framework. Previous approaches to this problem were limite...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
A new random geometric graph model, the so-called secrecy graph, is introduced and studied. The graph represents a wireless network and includes only edges over which secure commun...
GC
2008
Springer
13 years 8 months ago
2008
Springer
An acyclic coloring of a graph G is a proper coloring of the vertex set of G such that G contains no bichromatic cycles. The acyclic chromatic number of a graph G is the minimum nu...
GC
2002
Springer
13 years 7 months ago
2002
Springer
Given a graph on n vertices which is the union of two comparability graphs on the same vertex set, it always contains a clique or independent set of size n 1 3 . On the other hand...
CAV
2003
Springer
14 years 1 months ago
2003
Springer
We show that the model checking problem for µ-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. The result is presented by first sh...