4171 search results - page 105 / 835 » Choice numbers of graphs |
129
click to vote
GG
2004
Springer
15 years 11 months ago
2004
Springer
We propose a faithful encoding of Java programs (written in a suitable fragment of the language) to Graph Transformation Systems. Every program is translated to a set of rules incl...
155
click to vote
FLAIRS
2007
15 years 8 months ago
2007
We deal with the search process of the GraphPlan algorithm in this paper. We concentrate on a problem of finding supports for a sub-goal which arises during the search. We model t...
180
click to vote
NIPS
2008
15 years 7 months ago
2008
We show that an important and computationally challenging solution space feature of the graph coloring problem (COL), namely the number of clusters of solutions, can be accurately...
224
click to vote
IPL
2006
15 years 6 months ago
2006
A homomorphism from an oriented graph G to an oriented graph H is an arc-preserving mapping from V (G) to V (H), that is (x)(y) is an arc in H whenever xy is an arc in G. The orie...
160
click to vote
AAAI
2007
15 years 8 months ago
2007
We describe a novel approach to parallelizing graph search using structured duplicate detection. Structured duplicate detection was originally developed as an approach to external...