191 search results - page 4 / 39 » Intersections of graphs |
DAM
2011
13 years 2 months ago
2011
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...
COMPGEOM
2011
ACM
12 years 11 months ago
2011
ACM
Abstract. We study the grid size that is needed to represent intersection graphs of convex polygons. Here the polygons are similar to a base polygon P whose corners have rational c...
GD
2003
Springer
14 years 20 days ago
2003
Springer
Given two different drawings of a planar graph we consider the problem of morphing one drawing into the other. We designed and implemented an algorithm for intersection-free morph...
JGT
2008
13 years 7 months ago
2008
Let C be a family of n compact connected sets in the plane, whose intersection graph G(C) has no complete bipartite subgraph with k vertices in each of its classes. Then G(C) has ...
DAM
2002
13 years 7 months ago
2002
We establish results on NeST graphs (intersection tolerance graphs of neighborhood subtrees of a tree) and several subclasses. In particular, we show the equivalence of proper NeS...