Sciweavers

1188 search results - page 72 / 238
» Extended Graph Unification
Sort
View
AAAI
2004
14 years 17 days ago
A General Solution to the Graph History Interaction Problem
Since the state space of most games is a directed graph, many game-playing systems detect repeated positions with a transposition table. This approach can reduce search effort by ...
Akihiro Kishimoto, Martin Müller 0003
BIRTHDAY
2010
Springer
13 years 11 months ago
Change Management for Heterogeneous Development Graphs
Abstract. The error-prone process of formal specification and verification of large systems requires an efficient, evolutionary formal development approach. Development graphs have...
Serge Autexier, Dieter Hutter, Till Mossakowski
APPML
2007
57views more  APPML 2007»
13 years 11 months ago
On plane bipartite graphs without fixed edges
-An edge of a graph H with a perfect matching is a fixed edge if it either belongs to none or to all of the perfect matchings of H. It is shown that a connected plane bipartite gra...
Khaled Salem, Sandi Klavzar
CORR
2006
Springer
80views Education» more  CORR 2006»
13 years 11 months ago
A polynomial-time approximation algorithm for the number of k-matchings in bipartite graphs
We show that the number of k-matching in a given undirected graph G is equal to the number of perfect matching of the corresponding graph Gk on an even number of vertices divided ...
Shmuel Friedland, Daniel Levy
COMGEO
2004
ACM
13 years 11 months ago
How to draw the minimum cuts of a planar graph
We show how to utilize the cactus representation of all minimum cuts of a graph to visualize the minimum cuts of a planar graph in a planar drawing. In a first approach the cactus...
Ulrik Brandes, Sabine Cornelsen, Christian Fie&szl...