1736 search results - page 185 / 348 » On antimagic directed graphs |
187
click to vote
DSS
2002
15 years 6 months ago
2002
A thorough understanding of the way in which existing business processes currently practice is essential from the perspectives of both process reengineering and workflow managemen...
170
click to vote
ISCAPDCS
2007
15 years 8 months ago
2007
We address distributed real-time applications represented by systems of non-preemptive dependent periodic tasks. This system is described by an acyclic directed graph. Because the...
177
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
A new evolutionary method named “Genetic Network Programming with Control Nodes, GNPcn” has been proposed and applied to determine the timing of buying and selling stocks. GNP...
167
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Given a directed acyclic graph with labeled vertices, we consider the problem of finding the most common label sequences ("traces") among all paths in the graph (of some...
169
click to vote
IPL
2006
15 years 6 months ago
2006
We consider a special subgraph of a weighted directed graph: one comprising only the k heaviest edges incoming to each vertex. We show that the maximum weight branching in this su...