1559 search results - page 14 / 312 » Some Group Theory Problems |
COMBINATORICS
2004
14 years 9 months ago
2004
The basic functional equations for connected and 2-connnected graphs can be traced back to the statistical physicists Mayer and Husimi. They play an essential role in establishing...
110
click to vote
FSTTCS
2003
Springer
15 years 2 months ago
2003
Springer
The Covering Steiner problem is a common generalization of the k-MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with ed...
CP
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. The Quasigroup Completion Problem (QCP) is a very challenging benchmark among combinatorial problems, and the focus of much recent interest in the area of constraint prog...
APAL
2005
14 years 9 months ago
2005
Abstract. We prove that a finitely generated group is context-free whenever its Cayleygraph has a decidable monadic second-order theory. Hence, by the seminal work of Muller and Sc...
IAT
2010
IEEE
14 years 7 months ago
2010
IEEE
Group modeling is still an open challenge problem in pedestrian crowd simulations. Most existing work is based on socio-psychological models which can only describe the dynamics o...