1188 search results - page 87 / 238 » Extended Graph Unification |
PASTE
1998
ACM
15 years 5 months ago
1998
ACM
Static program slicing is an established method for analyzing sequential programs, especially for program understanding, debugging and testing. Until now, there was no slicing met...
100
Voted
CSCLP
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. Traditional resources in scheduling are simple machines where a capacity is the main restriction. However, in practice there frequently appear resources with more complex...
103
Voted
FAW
2008
Springer
15 years 2 months ago
2008
Springer
We prove that there exists an O(log(n))-labeling scheme for every first-order formula with free set variables in every class of graphs that is nicely locally cwd-decomposable, whic...
115
Voted
APVIS
2008
15 years 2 months ago
2008
We define the concept of crossing numbers for simultaneous graphs by extending the crossing number problem of traditional graphs. We discuss differences to the traditional crossin...
96
Voted
DAM
2008
15 years 27 days ago
2008
We study a variant of the pickup-and-delivery problem (PDP) in which the objects that have to be transported can be reloaded at most d times, for a given d N. This problem is kno...