Efficient dispersion algorithms for geometric intersection graphs

DOI10.1007/3-540-40064-8_11MaRDI QIDQ2766674zbMATH OpenFDO

Authors Peter Damaschke

Publication date 9 July 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-40064-8_11

zbMATH Keywords

dispersion problemefficient algorithmsminimum distance

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 2089217
• Powers of geometric intersection graphs and dispersion algorithms
• Dispersion on trees
• Approximation algorithms for dispersion problems
• Facility dispersion and remote subgraphs

Cited in

(3)

• Powers of geometric intersection graphs and dispersion algorithms
• scientific article; zbMATH DE number 2089217 (Why is no real title available?)
• An efficient method to evaluate intersections on big data sets

This page was built for publication: Efficient dispersion algorithms for geometric intersection graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2766674)