An Efficient Branch-and-Bound Algorithm for Finding a Maximum Clique

Etsuji Tomita, Tomokazu Seki

Source record

Source: Crossref

Published: Jan 1, 2003

DOI: 10.1007/3-540-45066-1_22

Open original source ↗

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.