Minimum cuts for circular-arc graphs
SIAM Journal on Computing
Linear time algorithms on circular-arc graphs
Information Processing Letters
On powers of m-trapezoid graphs
Discrete Applied Mathematics
On powers of circular arc graphs and proper circular arc graphs
Discrete Applied Mathematics
Perfect elimination orderings of chordal powers of graphs
Discrete Mathematics
Trapezoid graphs and generalizations, geometry and algorithms
Discrete Applied Mathematics
LexBFS-orderings and powers of chordal graphs
Discrete Mathematics
Parallel Algorithms for Shortest Paths and Related Problems on Trapezoid Graphs
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Generalized Maximum Independent Sets for Trees in Subquadratic Time
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Powers of Geometric Intersection Graphs and Dispersion Algorithms
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
| Hi-index | 0.00 |
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.