Powers of geometric intersection graphs and dispersion algorithms
Artikel i vetenskaplig tidskrift, 2003

We study powers of certain geometric intersection graphs: interval graphs, m-trapezoid graphs and circular-arc graphs. We define the pseudo product of two graphs on the same set of vertices, and show that it is contained in one of the three classes of graphs mentioned here above, if both factors are also in that class and fulfill certain conditions. This gives a new proof of the fact that these classes are closed under taking power; more importantly, we get efficient methods for computing the representation for the k-th power (k integer) of a graph that belongs to one of these classes, with a given representation sorted by endpoints. We then use these results to give efficient algorithms for the k-independent set, dispersion and weighted dispersion problem on these classes of graphs, provided that their geometric representations are given. (Abstract slightly adapted from the paper.)

dispersion

powers of graphs

trapezoid graphs

circular-arc graphs

interval graphs

intersection graphs

Författare

Geir Agnarsson

Armstrong Atlantic State University

Peter Damaschke

Chalmers, Institutionen för datavetenskap, Algoritmer

Magnus Halldorsson

Iceland Genomics Corp. (UVS)

Háskóli Íslands

Discrete Applied Mathematics

0166-218X (ISSN)

Vol. 132 3-16

Ämneskategorier

Data- och informationsvetenskap

DOI

10.1016/S0166-218X(03)00386-X