scientific article; zbMATH DE number 1759472
From MaRDI portal
Publication:4536426
zbMath0998.68091MaRDI QIDQ4536426
C. Stamm, Stephan J. Eidenbenz
Publication date: 25 November 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (4)
Coloring polygon visibility graphs and their generalizations ⋮ Computing the maximum clique in the visibility graph of a simple polygon ⋮ Unnamed Item ⋮ On the chromatic number of disjointness graphs of curves
This page was built for publication:
