320 search results - page 1 / 64 » Parity Problems in Planar Graphs |
COCO
2007
Springer
13 years 11 months ago
2007
Springer
We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...
MOR
2010
13 years 3 months ago
2010
We extend the work of Letchford (2000) by introducing a new class of valid inequalities for the traveling salesman problem, called the generalized domino-parity (GDP) constraints....
SIAMDM
2008
13 years 5 months ago
2008
A graph G is strict quasi parity (SQP) if every induced subgraph of G that is not a clique contains a pair of vertices with no odd chordless path between them (an even pair). Houga...
CSL
2003
Springer
13 years 10 months ago
2003
Springer
Many verification, planning, and control problems can be modeled as games played on state-transition graphs by one or two players whose conflicting goals are to form a path in th...
LATIN
2010
Springer
13 years 12 months ago
2010
Springer
Abstract. We define the notion of diversity for families of finite functions, and express the limitations of a simple class of holographic algorithms in terms of limitations on d...