Three ways to cover a graph

Source: arXiv

ABSTRACT We consider the problem of covering a host graph $G$ with several graphs from
a fixed template class ${T}$. The classical covering number of $G$ with respect
to ${T}$ is the minimum number of template graphs needed to cover the edges of
$G$. We introduce two new parameters: the local and the folded covering number.
Each parameter measures how far $G$ is from the template class in a different
way. Whereas the folded covering number has been investigated thoroughly for
some template classes, e.g., interval graphs and planar graphs, the local
covering number was given only little attention.
We provide new bounds on each covering number w.r.t. the following template
classes: linear forests, star forests, caterpillar forests, and interval
graphs. The classical graph parameters turning up this way are interval-number,
track-number, and linear-, star-, and caterpillar arboricity. As host graphs we
consider graphs of bounded degeneracy, bounded degree, or bounded (simple)
tree-width, as well as, outerplanar, planar bipartite and planar graphs. For
several pairs of a host class and a template class we determine the maximum
(local, folded) covering number of a host graph w.r.t. that template class

  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper we propose two new multilayer grid models for VLSI layout, both of which take into account the number of contact cuts used. For the first model in which nodes “exist” only on one layer, we prove a tight area × (number of contact cuts) = Θ(n 2) tradeoff for embeddingn-node planar graphs of bounded degree in two layers. For the second model in which nodes “exist” simultaneously on all layers, we give a number of upper bounds on the area needed to embed groups using no contact cuts. We show that anyn-node graph of thickness 2 can be embedded on two layers inO(n 2) area. This bound is tight even if more layers and any number of contact cuts are allowed. We also show that planar graphs of bounded degree can be embedded on two layers inO(n 3/2(logn)2) area. Some of our embedding algorithms have the additional property that they can respect prespecified grid placements of the nodes of the graph to be embedded. We give an algorithm for embeddingn-node graphs of thicknessk ink layers usingO(n 3) area, using no contact cuts, and respecting prespecified node placements. This area is asymptotically optimal for placement-respecting algorithms, even if more layers are allowed, as long as a fixed fraction of the edges do not use contact cuts. Our results use a new result on embedding graphs in a single-layer grid, namely an embedding ofn-node planar graphs such that each edge makes at most four turns, and all nodes are embedded on the same line.
    Algorithmica 01/1991; 6:129-151. · 0.49 Impact Factor
  • Mathematica Slovaca 01/1980; · 0.39 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We consider the problem of scheduling jobs that are given as groups of non-intersecting segments on the real line. Each job J j is associated with an interval, I j , which consists of up to t segments, for some t 1, a positive weight, w j , and two jobs are in conflict if any of their segments intersect. Such jobs show up in a wide range of applications, including the transmission of continuous-media data, allocation of linear resources (e.g. bandwidth in linear processor arrays), and in computational biology/geometry. The objective is to schedule a subset of non-conflicting jobs of maximum total weight.
    SIAM J. Comput. 01/2006; 36:1-15.


Available from
May 27, 2014