Skip to main content
SpringerLink
Log in

STABULUS: A technique for finding stable sets in large graphs with tabu search

STABULUS: Eine Technik zur Bestimmung unabhängiger Knotenmengen in großen Graphen mit der Tabu-Search-Methode

  • Published:
Computing Aims and scope Submit manuscript

Abstract

Numerical experiments with tabu search have been carried out for constructing independent sets in large graphs. We present some variations on the independent set problem and discuss the results obtained by the tabu search technique.

As for graph coloring, this method seems to be a very efficient heuristic procedure.

Zusammenfassung

Numerische Experimente mit der sogenannten Tabu-Search-Methode wurden durchgeführt, um unabhängige Knotenmengen in Graphen zu finden (eine KnotenmengeS ist dann unabhängig, wenn keine Kante beide Endknoten inS hat).

Einige Variationen über dieses Problem werden betrachtet (eine gewichtete Version wird beschrieben) und wir geben Resultate an, die zeigen, daß die Tabu-Methode für die Bestimmung unabhängiger Knotenmengen so effizient wie für die Graphenfärbung ist.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Balas, E., Yu, C.: Finding a maximum clique in an arbitrary graph. SIAM J. Comput.15, 1054–1068 (1986).

    Google Scholar 

  2. Berge, C.: Graphes. Paris: Gauthier-Villars 1983.

    Google Scholar 

  3. Bollobàs, B., Thomason, A.: Random graphs of small order, Random graphs '83. Annals of Discrete Mathematics28, 47–97 (1985).

    Google Scholar 

  4. Chams, M., Hertz, A., de Werra, D.: Some experiments with simulated annealing for coloring graphs. European Journal of Operational Research32, 260–266 (1987).

    Google Scholar 

  5. Glover, F.: Tabu search. Paper presented at ORSA/TIMS meeting, St. Louis, Mo (1987).

  6. Glover, F.: Future paths for integer programming and links to artificial intelligence. Computers and Operations Research13, 533–549 (1986).

    Google Scholar 

  7. Hertz, A., de Werra, D.: Using tabu search techniques for graph coloring. Computing39, 345–351 (1987).

    Google Scholar 

  8. Johnson, D. S., Yannakakis, M., Papadimitriou, C. H.: On generating all maximal independent sets. Information Processing Letters27, 119–123 (1988).

    Google Scholar 

  9. Johri, A., Matula, D. W.: Probabilistic bounds and heuristic algorithms for coloring large random graphs. Southern Methodist University, Dallas, Texas (1982).

    Google Scholar 

  10. Leighton, F.: A graph coloring algorithm for large scheduling problems. Journal of Research of the National Bureau of Standards84, 489–503 (1979).

    Google Scholar 

  11. Loukakis, E.: A new backtracking algorithm for generating the family of maximal independent sets of a graph. Computer and Mathematics with Applications9, 583–589 (1983).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Swiss Federal Institute of Technology, CH-1015, Lausanne-Ecublens, Switzerland

    C. Friden, A. Hertz & D. de Werra

Authors
  1. C. Friden
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Hertz
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. D. de Werra
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Friden, C., Hertz, A. & de Werra, D. STABULUS: A technique for finding stable sets in large graphs with tabu search. Computing 42, 35–44 (1989). https://doi.org/10.1007/BF02243141

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02243141

Key words

Search

Navigation