✦ LIBER ✦

Subgraph extraction and metaheuristics for the maximum clique problem

✍ Scribed by Duc-Cuong Dang, Aziz Moukrim

Book ID: 118799029
Publisher: Springer US
Year: 2012
Tongue: English
Weight: 877 KB
Volume: 18
Category: Article
ISSN: 1381-1231
DOI: 10.1007/s10732-012-9207-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Approximating the maximum clique minor a

Approximating the maximum clique minor and some subgraph homeomorphism problems

✍ Noga Alon; Andrzej Lingas; Martin Wahlen 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 329 KB

Approximations for the maximum acyclic s

Approximations for the maximum acyclic subgraph problem

✍ Refael Hassin; Shlomi Rubinstein 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 722 KB

Hard graphs for the maximum clique probl

Hard graphs for the maximum clique problem

✍ Cornelis Hoede 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 299 KB

Tight Bounds for the Maximum Acyclic Sub

Tight Bounds for the Maximum Acyclic Subgraph Problem

✍ Bonnie Berger; Peter W Shor 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 209 KB

Given a directed graph G s V, A , the maximum acyclic subgraph problem is to Ž . find a maximum cardinality subset AЈ of the arcs such that GЈ s V, AЈ is acyclic. In this paper, we present polynomial-time and RNC algorithms which, when given Ž any graph G without two-cycles, find an acyclic subgraph

Phased local search for the maximum cliq

Phased local search for the maximum clique problem

✍ Wayne Pullan 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 316 KB