3204 search results - page 272 / 641 » The b-chromatic Number of a Graph |
100
Voted
DM
2011
14 years 7 months ago
2011
If X is a geodesic metric space and x1, x2, x3 ∈ X, a geodesic triangle T = {x1, x2, x3} is the union of the three geodesics [x1x2], [x2x3] and [x3x1] in X. The space X is δ-hy...
103
Voted
WWW
2005
ACM
16 years 1 months ago
2005
ACM
Recent developments in the area of neural networks provided new models which are capable of processing general types of graph structures. Neural networks are well-known for their ...
93
Voted
SIGMOD
2004
ACM
16 years 28 days ago
2004
ACM
Trees and graphs are widely used to model biological databases. Providing efficient algorithms to support tree-based or graph-based querying is therefore an important issue. In th...
112
Voted
ICCAD
2003
IEEE
15 years 9 months ago
2003
IEEE
Abstract: In this paper, we present an interprocessor communication-aware task scheduling algorithm applicable to a multiprocessor system executing an application with dependent ta...
LATIN
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. We introduce the NP-hard graph-based data clustering problem s-Plex Cluster Vertex Deletion, where the task is to delete at most k vertices from a graph so that the conne...