68 search results - page 10 / 14 » Symplectic graphs and their automorphisms |
WG
1998
Springer
13 years 11 months ago
1998
Springer
We study the integral uniform (multicommodity) flow problem in a graph G and construct a fractional solution whose properties are invariant under the action of a group of automorp...
ISAAC
2005
Springer
14 years 26 days ago
2005
Springer
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
PADS
2004
ACM
14 years 24 days ago
2004
ACM
We investigated the benefit of exploiting the symmetries of graphs for partitioning. We represent the model to be simulated by a weighted graph. Graph symmetries are studied in th...
CP
2005
Springer
14 years 27 days ago
2005
Springer
Abstract. Many symmetry breaking techniques assume that the symmetries of a CSP are given as input in addition to the CSP itself. We present a method that can be used to detect all...
AAAI
2010
13 years 8 months ago
2010
We develop a method for detecting symmetries in arbitrary games and exploiting these symmetries when using tree search to play the game. Games in the General Game Playing domain a...