31 search results - page 5 / 7 » Maximal independent sets in graphs with at most r cycles |
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We consider concurrent games played on graphs. At every round of the game, each player simultaneously and independently selects a move; the moves jointly determine the transition ...
PODC
2011
ACM
14 years 9 days ago
2011
ACM
In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model [4,9,10]. This model includes two types...
171
click to vote
SPAA
2012
ACM
12 years 12 months ago
2012
ACM
In this paper we study distributed algorithms on massive graphs where links represent a particular relationship between nodes (for instance, nodes may represent phone numbers and ...
RECOMB
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We consider the problem of aligning two metabolic pathways. Unlike traditional approaches, we do not restrict the alignment to one-to-one mappings between the molecules o...
CGO
2006
IEEE
15 years 3 months ago
2006
IEEE
Explicit Data Graph Execution (EDGE) architectures offer the possibility of high instruction-level parallelism with energy efficiency. In EDGE architectures, the compiler breaks ...