3211 search results - page 330 / 643 » On the Grundy Number of a Graph |
173
click to vote
SPAA
2004
ACM
16 years 5 days ago
2004
ACM
We present the Buffer Heap (BH), a cache-oblivious priority queue that supports Delete-Min, Delete, and Decrease-Key operations in O( 1 B log2 N B ) amortized block transfers fro...
260
click to vote
WWW
2011
ACM
15 years 1 months ago
2011
ACM
Social network services have become a viable source of information for users. In Twitter, information deemed important by the community propagates through retweets. Studying the c...
212
click to vote
ICALP
2011
Springer
14 years 10 months ago
2011
Springer
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
281
click to vote
CIE
2011
Springer
14 years 6 months ago
2011
Springer
Automatic classes are classes of languages for which a finite automaton can decide whether a given element is in a set given by its index. The present work studies the learnabilit...
176
Voted
STOC
2007
ACM
16 years 7 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...