scientific article; zbMATH DE number 1522929

MaRDI QIDQ4511225zbMATH OpenFDO

Authors Stephan J. Eidenbenz

Publication date 30 October 2000

zbMATH Keywords

MAXIMUM CLIQUE problem

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Hiding people in polygons
• If you can hide behind it, can you hide inside it?
• scientific article; zbMATH DE number 513366
• Optimal search and ambush for a hider who can escape the search region
• How many cliques can a clique cover cover?
• How many zombies are needed to catch the survivor on toroidal grids?
• How many people can be controlled in a group pursuit game
• Where to hide the bits?

Cited in

(2)

• Hiding people in polygons
• Inapproximability of finding maximum hidden sets on polygons and terrains

This page was built for publication:

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