Publication:4536426

zbMath0998.68091MaRDI QIDQ4536426

C. Stamm, Stephan J. Eidenbenz

Publication date: 25 November 2002

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68W25: Approximation algorithms

Related Items

Computing the maximum clique in the visibility graph of a simple polygon