3211 search results - page 309 / 643 » On the Grundy Number of a Graph |
197
click to vote
CN
2010
15 years 3 months ago
2010
Probabilistic flooding has been frequently considered as a suitable dissemination information approach for limiting the large message overhead associated with traditional (full) f...
180
click to vote
WWW
2005
ACM
16 years 7 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 ...
176
click to vote
SIGMOD
2004
ACM
16 years 6 months 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...
192
click to vote
ICCAD
2003
IEEE
16 years 3 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...
177
Voted
LATIN
2010
Springer
16 years 1 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...