✦ LIBER ✦

Test case generators and computational results for the maximum clique problem

✍ Scribed by Jonas Hasselberg; Panos M. Pardalos; George Vairaktarakis

Book ID: 105069865
Publisher: Springer US
Year: 1993
Tongue: English
Weight: 983 KB
Volume: 3
Category: Article
ISSN: 0925-5001
DOI: 10.1007/bf01096415

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A generalization of chordal graphs and t

A generalization of chordal graphs and the maximum clique problem

✍ Assef Chmeiss; Philippe Jégou 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 584 KB

A graph is chordal or triangulated if it has no chordless cycle with four or more vertices. Chordal graphs are well known for their combinatorial and algorithmic properties. Here we introduce a generalization of chordal graphs, namely CSGk graphs. Informally, a CSG' graph is a complete graph, and fo

A branch and bound algorithm for the max

A branch and bound algorithm for the maximum clique problem

✍ L. Babel; G. Tinhofer 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 451 KB

The worst-case time complexity for gener

The worst-case time complexity for generating all maximal cliques and computational experiments

✍ Etsuji Tomita; Akira Tanaka; Haruhisa Takahashi 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 300 KB

Edge-maximal triangulated subgraphs and

Edge-maximal triangulated subgraphs and heuristics for the maximum clique problem

✍ Jue Xue 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 855 KB

Optimized Crossover-Based Genetic Algori

Optimized Crossover-Based Genetic Algorithms for the Maximum Cardinality and Maximum Weight Clique Problems

✍ Egon Balas; William Niehaus 📂 Article 📅 1998 🏛 Springer US 🌐 English ⚖ 135 KB

Test Generation for Crosstalk-Induced Fa

Test Generation for Crosstalk-Induced Faults: Framework and Computational Results

✍ Wei-Yu Chen; Sandeep K. Gupta; Melvin A. Breuer 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 226 KB