1188 search results - page 48 / 238 » Extended Graph Unification |
CSL
2007
Springer
14 years 4 months ago
2007
Springer
The question of the exact complexity of solving parity games is one of the major open problems in system verification, as it is equivalent to the problem of model-checking the mod...
AAAI
2006
13 years 11 months ago
2006
The scalability of graph-search algorithms can be greatly extended by using external memory, such as disk, to store generated nodes. We consider structured duplicate detection, an...
DM
2008
13 years 10 months ago
2008
In edge colouring it is often useful to have information about the degree distribution of the neighbours of a given vertex. For example, the well known Vizing's Adjacency Lem...
ALGORITHMICA
2002
13 years 9 months ago
2002
Given a directed acyclic graph with timing constraints, the budget management problem is to assigntoeachvertexanincrementaldelaysuchthatthesumofthesedelaysismaximizedwithoutviolati...
ECEASST
2010
13 years 7 months ago
2010
Abstract. The precise specification of software models is a major concern in model-driven design of object-oriented software. In this paper, we investigate how program graphs, a la...