๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An O(n log n + m log log n) maximum weight clique algorithm for circular-arc graphs

โœ Scribed by Wei-Kuan Shih; Wen-Lian Hsu

Book ID
113163459
Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
852 KB
Volume
31
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

AnO(m + n log n) Alg
AnO(m + n log n) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs
โœ Binay K. Bhattacharya; Damon Kaller ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 338 KB

We present an algorithm to compute, in O m q n log n time, a maximum clique ลฝ . in circular-arc graphs with n vertices and m edges provided a circular-arc model of the graph is given. If the circular-arc endpoints are given in sorted order, the ลฝ . time complexity is O m . The algorithm operates on

An O(n log n) algorithm for finding diss
An O(n log n) algorithm for finding dissimilar strings
โœ Sarmad Abbasi; Anirvan Sengupta ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 411 KB

Let P be a finite alphabet and x E Z'. A string y E Zm is said to be k-dissimilar to x, if no k length substring of x is equal to any k length substring of y. We present an 0( n log n) algorithm which on input x E 2? and an integer m < n outputs an integer k and y E .Zm such that: (1) y is k-dissimi