1736 search results - page 132 / 348 » On antimagic directed graphs |
180
click to vote
ICPP
2000
IEEE
15 years 11 months ago
2000
IEEE
We consider an efficient distributed algorithm for determining a dominating and absorbant set of vertices (mobile hosts) in a given directed graph that represents an ad hoc wirel...
184
click to vote
ICDAR
2009
IEEE
15 years 4 months ago
2009
IEEE
Combining classifier methods have shown their effectiveness in a number of applications. Nonetheless, using simultaneously multiple classifiers may result in some cases in a reduc...
194
click to vote
IPPS
2010
IEEE
15 years 3 months ago
2010
IEEE
In this study, we consider an environment composed of a heterogeneous cluster of multicore-based machines used to analyze satellite images. The workload involves large data sets, a...
190
click to vote
TCBB
2011
15 years 1 months ago
2011
—We study the problem of merging genetic maps, when the individual genetic maps are given as directed acyclic graphs. The computational problem is to build a consensus map, which...
169
click to vote
ESA
1999
Springer
15 years 10 months ago
1999
Springer
We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property π is called a π-graph. If π satis...