320 search results - page 2 / 64 » Parity Problems in Planar Graphs |
ICALP
2010
Springer
15 years 1 months ago
2010
Springer
Energy parity games are infinite two-player turn-based games played on weighted graphs. The objective of the game combines a (qualitative) parity condition with the (quantitative)...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
The isomorphism problem for planar graphs is known to be efficiently solvable. For planar 3-connected graphs, the isomorphism problem can be solved by efficient parallel algorithm...
84
Voted
FOSSACS
2006
Springer
15 years 1 months ago
2006
Springer
We consider parity games played on special pushdown graphs, namely those generated by one-counter processes. For parity games on pushdown graphs, it is known from [22] that decidin...
ARSCOM
2005
14 years 9 months ago
2005
We investigate the supereulerian graph problems within planar graphs, and we prove that if a 2-edge-connected planar graph G is at most three edges short of having two edge-disjoi...
SODA
2010
ACM
15 years 6 months ago
2010
ACM