168 search results - page 13 / 34 » New upper bounds on the decomposability of planar graphs |
SIAMDM
2008
13 years 6 months ago
2008
We first show that for any bipartite graph H with at most five vertices, there exists an on-line competitive algorithm for the class of H-free bipartite graphs. We then analyze th...
ECCC
2010
13 years 4 months ago
2010
We consider the reachability problem for a certain class of directed acyclic graphs embedded on surfaces. Let G(m, g) be the class of directed acyclic graphs with m = m(n) source ...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Given a graph G, an identifying code D V (G) is a vertex set such that for any two distinct vertices v1, v2 V (G), the sets N[v1] D and N[v2] D are distinct and nonempty (here...
JGAA
2006
13 years 6 months ago
2006
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
ESA
2005
Springer
14 years 8 days ago
2005
Springer
Abstract. We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edge-weighted undirected planar graphs that are re...