Searching for "Simple and Fast Improving a Branch-And-Bound Algorithm for Maximum Clique." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

Simple and Fast: Improving a Branch-and-Bound Algorithm for Maximum Clique
by Torsten Fahle — 2002 — In 10th Annual European Symposium on Algorithms (ESA 2002), volume 2461 of LNCS
…Simple and Fast: Improving a Branch-And-Bound Algorithm for Maximum Clique ? Torsten Fahle…
Cited by 11 (0 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB