Finding all k-cliques in k-partite graphs, an application in textile engineering
Authors:
- Tore GrünertTGTore Grünert
- Stefan IrnichSIStefan Irnich
- Hans-Jürgen ZimmermannHZHans-Jürgen Zimmermann
- Markus SchneiderMSMarkus Schneider
- Burkhard WulfhorstBWBurkhard Wulfhorst
- 1 January 2002
- journal article
- research article
- Published by Elsevier in Computers & Operations Research
- Vol. 29 (1) , 13-31
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Solving the maximum clique problem using a tabu search approachAnnals of Operations Research, 1993
- Finding maximum cliques in arbitrary and in special graphsComputing, 1991
- A branch and bound algorithm for the maximum clique problemMathematical Methods of Operations Research, 1990
- Tabaris: An exact algorithm based on tabu search for finding a maximum independent set in a graphComputers & Operations Research, 1990
- Finding a Maximum Clique in an Arbitrary GraphSIAM Journal on Computing, 1986
- A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cyclesMathematical Programming, 1981
- Clique detection for nondirected graphs: Two new algorithmsComputing, 1979
- A node covering algorithmNaval Research Logistics Quarterly, 1977
- Vertex packings: Structural properties and algorithmsMathematical Programming, 1975
- Algorithm 457: finding all cliques of an undirected graphCommunications of the ACM, 1973