1963 search results - page 175 / 393 » The Maximum Solution Problem on Graphs |
151
click to vote
AI
2010
Springer
15 years 2 months ago
2010
Springer
How can an intelligent agent update her knowledge base about an action domain, relative to some conditions (possibly obtained from earlier observations)? We study this question in...
112
click to vote
CDC
2010
IEEE
14 years 9 months ago
2010
IEEE
Existing work on programmable self assembly has focused on deterministic performance guarantees--stability of desirable states. In particular, for any acyclic target graph a binary...
134
Voted
WG
2007
Springer
15 years 8 months ago
2007
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
125
click to vote
SIBGRAPI
2005
IEEE
15 years 8 months ago
2005
IEEE
Graph sub-isomorphism is a very common approach to solving pattern search problems, but this is a NP-complete problem. This way, it is necessary to invest in research of approxima...
120
click to vote
ENTCS
2008
15 years 2 months ago
2008
We describe a method for proving the termination of graph transformation systems. The method is based on the fact that infinite reductions must include infinite `creation chains&#...