3757 search results - page 76 / 752 » The overlap number of a graph |
PARA
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. This paper investigates two types of overhead due to duplicated local computations, which are frequently encountered in the parallel software of overlapping domain decomp...
IJBRA
2007
14 years 9 months ago
2007
: A large number of ontologies have been introduced by the biomedical community in recent years. From an application perspective, identifying related ontologies and linking them to...
ALGORITHMICA
2010
14 years 10 months ago
2010
We present the first dynamic graph algorithm for recognizing interval graphs. The algorithm runs in O(n log n) worst-case time per edge deletion or edge insertion, where n is the ...
ENDM
2007
14 years 9 months ago
2007
The circular chromatic number of a graph is a well-studied refinement of the chromatic number. Circular-perfect graphs is a superclass of perfect graphs defined by means of this...
JCT
2010
14 years 8 months ago
2010
The vertex Folkman number F(r, n, m), n < m, is the smallest integer t such that there exists a Km-free graph of order t with the property that every r-coloring of its vertices...