193 search results - page 17 / 39 » Duality in Infinite Graphs |
NJC
2000
13 years 8 months ago
2000
In order to deal with infinite regular trees (or other pointed graph structures) efficiently, we give new algorithms to store such structures. The trees are stored in such a way th...
AAAI
2010
13 years 10 months ago
2010
Depth-first proof-number search (df-pn) is powerful AND/OR tree search to solve positions in games. However, df-pn has a notorious problem of infinite loops when applied to domain...
LICS
1997
IEEE
14 years 4 days ago
1997
IEEE
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
WG
1993
Springer
14 years 20 days ago
1993
Springer
Recently in several papers, graphs with maximum neighborhood orderings were characterized and turned out to be algorithmically useful. This paper gives a unified framework for cha...
DM
2006
13 years 8 months ago
2006
A graph is called almost self-complementary if it is isomorphic to one of its almost complements Xc - I, where Xc denotes the complement of X and I a perfect matching (1-factor) i...