320 search results - page 44 / 64 » Parity Problems in Planar Graphs |
114
click to vote
SPIN
2010
Springer
14 years 11 months ago
2010
Springer
Pushdown systems provide a natural model of software with recursive procedure calls. We provide a tool implementing an algorithm for computing the winning regions of a pushdown par...
106
click to vote
TIT
2011
14 years 8 months ago
2011
Abstract—This work addresses the computational complexity of achieving the capacity of a general network coding instance. We focus on the linear capacity, namely the capacity of ...
128
click to vote
APPROX
2008
Springer
15 years 3 months ago
2008
Springer
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
106
click to vote
IPL
2007
15 years 1 months ago
2007
We deal with the problem of maintaining a dynamic graph so that queries of the form “is there an edge between u and v?” are processed fast. We consider graphs of bounded arbor...
121
click to vote
SODA
2012
ACM
13 years 3 months ago
2012
ACM
We give a deterministic algorithm to find the minimum cut in a surface-embedded graph in near-linear time. Given an undirected graph embedded on an orientable surface of genus g,...