1952 search results - page 32 / 391 » Complete partitions of graphs |
114
click to vote
PCM
2004
Springer
15 years 9 months 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...
134
Voted
ECAI
2010
Springer
15 years 5 months ago
2010
Springer
Landmarks for a planning problem are subgoals that are necessarily made true at some point in the execution of any plan. Since verifying that a fact is a landmark is PSPACE-complet...
113
click to vote
EJC
2007
15 years 3 months ago
2007
Let K− r denote the graph obtained from Kr by deleting one edge. We show that for every integer r ≥ 4 there exists an integer n0 = n0(r) such that every graph G whose order n â...
147
Voted
ENDM
2002
15 years 3 months ago
2002
Given a positive integer n and a family F of graphs, let R(n, F) denote the maximum number of colors in an edge-coloring of Kn such that no subgraph of Kn belonging to F has disti...
130
Voted
SAC
2010
ACM
15 years 10 months ago
2010
ACM
This article addresses the problem of efficient multi-robot patrolling in a known environment. The proposed approach assigns regions to each mobile agent. Every region is represen...