641 search results - page 77 / 129 » On Planar Quasi-Parity Graphs |
183
click to vote
WDAG
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
184
click to vote
SIAMDM
2010
15 years 26 days ago
2010
The following problem was introduced by Marcin Krzywkowski as a generalization of a problem of Todd Ebert. After initially coordinating a strategy, n players each occupy a differe...
138
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The disjoint paths problem asks, given an graph G and k + 1 pairs of terminals (s0, t0), . . . , (sk, tk), whether there are k + 1 pairwise disjoint paths P0, . . . , Pk, such tha...
172
click to vote
ENDM
2008
15 years 6 months ago
2008
A strong oriented k-coloring of an oriented graph G is a homomorphism from G to H having k vertices labelled by the k elements of an abelian additive group M, such that for any p...
159
click to vote
JNW
2008
15 years 6 months ago
2008
Abstract-- We study the communication primitive of broadcasting (one-to-all communication) in known topology radio networks, i.e., where for each primitive the schedule of transmis...