779 search results - page 122 / 156 » A graph polynomial for independent sets of bipartite graphs |
171
click to vote
PODC
2011
ACM
14 years 9 months 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...
158
click to vote
FSTTCS
2009
Springer
16 years 21 days ago
2009
Springer
ABSTRACT. We consider concurrent systems that can be modelled as 1-safe Petri nets communicating through a fixed set of buffers (modelled as unbounded places). We identify a param...
155
click to vote
IJHPCA
2006
15 years 6 months ago
2006
In this paper, we consider the communications involved in the execution of a complex application, deployed on a heterogeneous platform. Such applications extensively use macro-com...
146
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We study the set of all pseudoline arrangements with contact points which cover a given support. We define a notion of flip which transforms a pseudoline arrangement with contact...
188
click to vote
SETA
2004
Springer
15 years 11 months ago
2004
Springer
We enumerate the inequivalent self-dual additive codes over GF(4) of blocklength n, thereby extending the sequence A090899 in The On-Line Encyclopedia of Integer Sequences from n =...