On rectangle intersection and overlap graphs
From MaRDI portal
Publication:4868153
DOI10.1109/81.414831zbMath0838.68089OpenAlexW2133596079MaRDI QIDQ4868153
Publication date: 5 March 1996
Published in: IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/81.414831
Related Items
On some applications of the selective graph coloring problem ⋮ Maximum independent set and maximum clique algorithms for overlap graphs ⋮ Interval graph limits ⋮ Matching colored points with rectangles ⋮ Independent set of intersection graphs of convex objects in 2D