3211 search results - page 438 / 643 » On the Grundy Number of a Graph |
166
click to vote
PODC
2005
ACM
16 years 3 days ago
2005
ACM
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
179
click to vote
ATAL
2005
Springer
16 years 3 days ago
2005
Springer
A directed agent implies an agent with high constraints in both recognition and motion. Because of the embodied restrictions, the directed agent perceives a sense of subjective di...
194
click to vote
HIPC
2005
Springer
16 years 2 days ago
2005
Springer
Abstract. Linear scan register allocation is an attractive register allocation algorithm because of its simplicity and fast running time. However, it is generally felt that linear ...
179
click to vote
ISCIS
2005
Springer
16 years 1 days ago
2005
Springer
Dense subgraphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Computing them however is generally expe...
129
click to vote
WEBI
2005
Springer
16 years 1 days ago
2005
Springer
Cycle detection in graphs and digraphs has received wide attention and several algorithms are available for this purpose. While the web may be modeled as a digraph, such algorithm...