534 search results - page 28 / 107 » Diameter critical graphs |
KES
2005
Springer
14 years 3 months ago
2005
Springer
The ubiquity of chance discovery can be seen in many areas of application, fundamentally when there are events that are difficult to find or predict. In this paper, we present our...
APPROX
2011
Springer
12 years 9 months ago
2011
Springer
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
IWPEC
2010
Springer
13 years 7 months ago
2010
Springer
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
ESANN
2003
13 years 11 months ago
2003
We propose the use of the Gabriel graph for the exploratory analysis of potentially high dimensional labeled data. Gabriel graph is a subgraph of the Delaunay triangulation, which ...
IPPS
2006
IEEE
14 years 3 months ago
2006
IEEE
In both distributed counting and queuing, processors in a distributed system issue operations which are organized into a total order. In counting, each processor receives the rank...