"How randomized search heuristics find maximum cliques in planar graphs."

Tobias Storch (2006)

Details and statistics

DOI: 10.1145/1143997.1144099

access: closed

type: Conference or Workshop Paper

metadata version: 2024-02-05

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.