Abstract
The dispersion problem in a graph requires to find a subset of vertices of prescribed size, so as to maximize the minimum distance between the chosen vertices. We propose efficient algorithms solving the dispersion problem in interval graphs, circular-arc graphs, and trapezoid graphs. Graphs are supposed to be represented geometrically, rather than by their edge sets.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
B.K. Bhattacharya, M.E. Houle: Generalized maximum independent sets for trees, Computing-The 3rd Australasian Theory Symposium CATS’97
B.K. Bhattacharya, M.E. Houle: Generalized maximum independent sets for trees in subquadratic time, 10th ISAAC’99, LNCS 1741, 435–
A. Brandstädt, V.D. Chepoi, F.F. Dragan: Perfect elimination orderings of chordal powers of graphs, Discrete Math. 158 (1996), 273–278
A. Brandstädt, F.F. Dragan, F. Nicolai: LexBFS-orderings and powers of chordal graphs, Discrete Math. 171 (1997), 27–42
H.S. Chao, F.R. Hsu, R.C.T. Lee: On the shortest length queries for permutation graphs, Int. Computer Symp., Workshop on Algorithms 1998, NCKU Taiwan, 132–138
D.Z. Chen, D.T. Lee, R. Sridhar, C.N. Sekharan: Solving the all-pair shortest path query problem on interval and circular-arc graphs, Networks (1998), 249–257
S. Felsner, R. Müller, L. Wernisch: Trapezoid graphs and generalizations, geometry and algorithms, Discrete Applied Math. 74 (1997), 13–32
C. Flotow: On powers of m-trapezoid graphs, Discrete Applied Math. 63 (1995), 187–192
C. Flotow: On powers of circular arc graphs and proper circular arc graphs, Discrete Applied Math. 69 (1996), 199–207
F.R. Hsu, Y.L. Lin, Y.T. Tsai: Parallel algorithms for shortest paths and related problems on trapezoid graphs, 10th ISAAC’99, LNCS 1741, 173–
W.L. Hsu, K.H. Tsai: Linear-time algorithms on circular arc graphs, Info. Proc. Letters 40 (1991), 123–129
D.T. Lee, M. Sarrafzadeh, Y.F. Wu: Minimum cuts for circular-arc graphs, SIAM J. Computing 19 (1990), 1041–1050
Y.D. Liang: Comparative studies of algorithmic techniques for cocomparability graph families, Congr. Num. 122 (1996), 109–118
D.J. Rosenkrantz, G.K. Tayi, S.S. Ravi: Capacitated facility dispersion problems, to appear in J. of Comb. Optimization
S.Q. Zheng: Maximum independent sets of circular-arc graphs: simplified algorithms and proofs, Networks 28 (1996), 15–19
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Damaschke, P. (2000). Efficient Dispersion Algorithms for Geometric Intersection Graphs. In: Brandes, U., Wagner, D. (eds) Graph-Theoretic Concepts in Computer Science. WG 2000. Lecture Notes in Computer Science, vol 1928. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40064-8_11
Download citation
DOI: https://doi.org/10.1007/3-540-40064-8_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41183-3
Online ISBN: 978-3-540-40064-6
eBook Packages: Springer Book Archive