Integer representations of convex polygon intersection graphs

DOI10.1145/1998196.1998248zbMath1283.68374OpenAlexW2040475562MaRDI QIDQ5404443

Tobias Müller, Erik Jan van Leeuwen, Jan van Leeuwen

Publication date: 24 March 2014

Published in: Proceedings of the twenty-seventh annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://dspace.library.uu.nl/handle/1874/290268

zbMATH Keywords

upper and lower boundsconvex polygonsgeometric intersection graphsinteger representation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph representations (geometric and intersection representations, etc.) (05C62)

This page was built for publication: Integer representations of convex polygon intersection graphs