Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Etsuji Tomita
Information about the author Etsuji Tomita will soon be added to the site.
Found
3 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
2007
We present an exact and efficient branch-and-bound algorithm MCR for finding a maximum...
A simple and efficient branch and bound algorithm for finding a maximum clique with the experimental evaluations
1996
The authors present a simple and efficient branch and bound recursive algorithm for...
A randomized algorithm for finding a near-maximum clique and its experimental evaluations
1993
The so-called Maximum Clique Problem is one of the most famous NP-complete problems...
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers
