866 search results - page 119 / 174 » Algorithms for Comparing Pedigree Graphs |
GD
2006
Springer
14 years 26 days ago
2006
Springer
Circular graph layout is a drawing scheme where all nodes are placed on the perimeter of a circle. An inherent issue with circular layouts is that the rigid restriction on node pla...
BPM
2006
Springer
14 years 28 days ago
2006
Springer
Mining, discovering, and integrating process-oriented services has attracted growing attention in the recent year. Workflow precedence graph and workflow block structures are two i...
SODA
1992
ACM
13 years 10 months ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
INFOCOM
2009
IEEE
14 years 3 months ago
2009
IEEE
Abstract—Recently, cellular phone networks have begun allowing third-party applications to run over certain open-API phone operating systems such as Windows Mobile, Iphone and Go...
EMSOFT
2011
Springer
12 years 9 months ago
2011
Springer
Most of the hard-real-time scheduling theory for multiprocessor systems assumes independent periodic or sporadic tasks. Such a simple task model is not directly applicable to mode...