Skip to main content
SpringerLink
Log in
Book cover

International Conference on Field Programmable Logic and Applications

FPL 2004: Field Programmable Logic and Application pp 516–525Cite as

An Instance-Specific Hardware Algorithm for Finding a Maximum Clique

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3203))

Abstract

This paper presents a hardware algorithm for finding a maximum clique of a given graph, and shows experimental results of the proposed algorithm running on an FPGA. The proposed algorithm is constructed according to a given instance of graph, and can find a maximum clique efficiently based on branch and bound search. The proposed algorithm is designed to be implemented on FPGAs, and realizes an efficient branch and bound search with parallel and pipeline processing. Experimental results showed that, compared with the software solver, the proposed algorithm produced a maximum clique in a very shorter running time even if the time for circuit synthesis and configuration of FPGA was taken into account.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bomze, I.M., Budinich, M., Pardalos, P.M., Pelillo, M.: The maximum clique problem. In: Handbook of Combinatorial Optimization, vol. suppl. A, pp. 1–74. Kluwer Academic Publishers, Dordrecht (1999)

    Google Scholar 

  2. The DIMACS Challenge, ftp://dimacs.rutgers.edu/pub/challenge/graph/benchmarks/clique/

  3. Platzner, M., Micheli, G.D.: Acceleration of satisfiability algorithms by reconfigurable hardware. In: Proc. 8th International Workshop on Field-Programmable Logic and Applications, pp. 69–78 (1998)

    Google Scholar 

  4. Platzner, M.: Reconfigurable accelerators for combinatorial problems. IEEE Computer 33(4), 58–60 (2000)

    Google Scholar 

  5. Östergård, P.R.J.: A fast algorithm for the maximum clique problem. Discrete Applied Mathematics 120, 197–207 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  6. Suyama, T., Yokoo, M., Sawada, H.: Solving satisfiability problems on FPGAs. In: Glesner, M., Hartenstein, R.W. (eds.) FPL 1996. LNCS, vol. 1142, pp. 136–145. Springer, Heidelberg (1996)

    Google Scholar 

  7. Seki, T., Tomita, E.: Efficient branch-and-bound algorithms for finding a maximum clique. Technical Report of the Institute of Electronics, Information and Communication Engineers, COMP2001-50, pp. 101–108 (2001) (in Japanese)

    Google Scholar 

  8. Zhong, P., Martonosi, M., Ashar, P., Malik, S.: Using configurable computing to accelerate Boolean satisfiability. IEEE Transactions on Computer Aided Design of Integrated Circuits and Systems 18(6), 861–868 (1999)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Information Sciences, Hiroshima City University, 3-4-1, Ozuka-higashi, Asaminami-ku, Hiroshima, 731-3194, Japan

    Shin’ichi Wakabayashi & Kenji Kikuchi

Authors
  1. Shin’ichi Wakabayashi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kenji Kikuchi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. ITIV - Universitaet Karlsruhe (TH),  

    Jürgen Becker

  2. University of Paderborn,  

    Marco Platzner

  3. IMEC, Kapeldreef 75, Leuven, Leuven, Belgium

    Serge Vernalde

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wakabayashi, S., Kikuchi, K. (2004). An Instance-Specific Hardware Algorithm for Finding a Maximum Clique. In: Becker, J., Platzner, M., Vernalde, S. (eds) Field Programmable Logic and Application. FPL 2004. Lecture Notes in Computer Science, vol 3203. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30117-2_53

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30117-2_53

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22989-6

  • Online ISBN: 978-3-540-30117-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation