94 search results - page 10 / 19 » A study of the total chromatic number of equibipartite graph... |
GD
2004
Springer
14 years 1 months ago
2004
Springer
A k-stack layout (respectively, k-queue layout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges wi...
DM
2007
13 years 7 months ago
2007
In this paper we study the cycle base structures of embedded graphs on surfaces. We first give a sufficient and necessary condition for a set of facial cycles to be contained in ...
FSTTCS
2009
Springer
14 years 7 days ago
2009
Springer
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
PCM
2004
Springer
14 years 29 days ago
2004
Springer
The performance of a Content-Based Image Retrieval (CBIR) system presented in the form of Precision-Recall or PrecisionScope graphs offers an incomplete overview of the system und...
SIAMJO
2008
13 years 7 months ago
2008
Abstract. We consider the offline and online versions of a bin packing problem called bin packing with conflicts. Given a set of items V = {1, 2, . . . , n} with sizes s1, s2 . . ....