1188 search results - page 94 / 238 » Extended Graph Unification |
105
Voted
ESA
2006
Springer
15 years 4 months ago
2006
Springer
An instance of the path hitting problem consists of two families of paths, D and H, in a common undirected graph, where each path in H is associated with a non-negative cost. We r...
77
Voted
WSC
2007
15 years 3 months ago
2007
Event Graphs (EGs) and Simulation Graph Models provide a powerful and general modeling framework for discrete event simulation. Qualitative Event Graphs (QEGs) extend the EG frame...
127
click to vote
APPROX
2008
Springer
15 years 2 months ago
2008
Springer
We consider the variant of the minimum vertex cover problem in which we require that the cover induces a connected subgraph. We give new approximation results for this problem in d...
106
Voted
ALENEX
2004
15 years 2 months ago
2004
In previous work we described a method for compactly representing graphs with small separators, which makes use of small separators, and presented preliminary experimental results...
104
click to vote
IJCAI
2003
15 years 2 months ago
2003
We examine the approach of encoding planning problems as CSPs more closely. First we present a simple CSP encoding for planning problems and then a set of transformations that can...