1986 search results - page 236 / 398 » Path Separability of Graphs |
104
click to vote
COCOON
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. An undirected graph G = (V, E) is the k-power of an undirected tree T = (V, E ) if (u, v) ∈ E iff u and v are connected by a path of length at most k in T. The tree T ...
138
Voted
PDP
2003
IEEE
15 years 8 months ago
2003
IEEE
We consider the execution of a complex application on a heterogeneous "grid" computing platform. The complex application consists of a suite of identical, independent pr...
133
click to vote
CSL
2003
Springer
15 years 7 months ago
2003
Springer
Many verification, planning, and control problems can be modeled as games played on state-transition graphs by one or two players whose conflicting goals are to form a path in th...
104
Voted
IPPS
1994
IEEE
15 years 6 months ago
1994
IEEE
Many algorithms to schedule DAGs on multiprocessors have been proposed, but there has been little work done to determine their effectiveness. Since multi-processor scheduling is a...
153
Voted
IFIP
1992
Springer
15 years 6 months ago
1992
Springer
This paper presents a completely systematic design procedure for asynchronous controllers. The initial step is the construction of a signal transition graph (STG, an interpreted P...