✦ LIBER ✦

A Simple Algorithm for Finding a Maximum Clique and Its Worst-Case Time Complexity

✍ Scribed by Miklo Shindo; Etsuji Tomita

Book ID: 112205943
Publisher: John Wiley and Sons
Year: 1990
Tongue: English
Weight: 901 KB
Volume: 21
Category: Article
ISSN: 0882-1666
DOI: 10.1002/scj.4690210301

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A randomized algorithm for finding a nea

A randomized algorithm for finding a near-maximum clique and its experimental evaluations

✍ Yoshiaki Yamada; Etsuji Tomita; Haruhisa Takahashi 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 441 KB

## Abstract The so‐called Maximum Clique Problem is one of the most famous NP‐complete problems for which it is difficult to find a solution. Given an indirected graph, we present here a polynomial‐time randomized algorithm RaCLIQUE for finding a near‐maximum clique. While the basic idea of the alg

An efficient branch-and-bound algorithm

An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments

✍ Etsuji Tomita; Toshikatsu Kameda 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 95 KB

An Efficient Branch-and-bound Algorithm

An Efficient Branch-and-bound Algorithm for Finding a Maximum Clique with Computational Experiments

✍ Etsuji Tomita; Toshikatsu Kameda 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 227 KB

A New Algorithm and Worst Case Complexit

A New Algorithm and Worst Case Complexity for Feynman–Kac Path Integration

✍ Leszek Plaskota; Grzegorz W. Wasilkowski; Henryk Woźniakowski 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 121 KB

We study algorithms for approximation of Feynman-Kac path integrals in the worst case setting. The algorithms use a finite number of samples of the initial condition and potential functions. We present a new algorithm and an explicit bound on its cost to compute an ε-approximation to the Feynman-Kac

A simple linear time algorithm for findi

A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals alone

✍ Glenn K. Manacher; Terrance A. Mankus 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 209 KB 👁 1 views

## Abstract We exhibit an algorithm for finding a maximum independent set (MIS) for __n__ presorted, unweighted circular arcs in time 0(__n__). Unlike previous algorithms, this is achieved by means of trivial postprocessing of the output of a straightforward algorithm for finding an MIS for a set o

A simple greedy algorithm for finding fu

A simple greedy algorithm for finding functional relations: efficient implementation and average case analysis

✍ Tatsuya Akutsu; Satoru Miyano; Satoru Kuhara 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 186 KB

Inferring functional relations from relational databases is important for the discovery of scientiÿc knowledge because many experimental data are represented in the form of tables and many rules are represented in the form of functions. A simple greedy algorithm has been known as an approximation al