250 search results - page 23 / 50 » Constructing a Class of Symmetric Graphs |
149
click to vote
ENTCS
2007
15 years 5 months ago
2007
We define a rewrite strategy for a class of non-confluent constructor-based term graph rewriting systems and discuss its correctness. Our strategy and its extension to narrowing...
150
click to vote
JOLLI
2010
15 years 4 months ago
2010
Abstract. When seeking to coordinate in a game with imperfect information, it is often relevant for a player to know what other players know. Keeping track of the information acqui...
180
click to vote
SPAA
2004
ACM
15 years 11 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
176
click to vote
EJC
2007
15 years 5 months ago
2007
We construct algorithms for deciding essentially any minor-closed parameter, with explicit time bounds. This result strengthens previous results by Robertson and Seymour [1,2], Fr...
163
click to vote
CC
2003
Springer
15 years 11 months ago
2003
Springer
We define the Value State Dependence Graph (VSDG). The VSDG is a form of the Value Dependence Graph (VDG) extended by the addition of state dependence edges to model sequentialise...