A parallel algorithm for finding a maximum weight clique of an interval graph

1990 ◽  
Vol 13 (2) ◽  
pp. 253-256 ◽  
Author(s):  
Chii-Huah Shyu
Keyword(s):  
Parallel Algorithm ◽  
Interval Graph ◽  
Maximum Weight ◽  
Maximum Weight Clique

DYNAMIC PROGRAMMING ON INTERVALS

1993 ◽  
Vol 03 (03) ◽  
pp. 323-330 ◽  
Author(s):  
TAKAO ASANO
Keyword(s):  
Dynamic Programming ◽  
Dominating Set ◽  
Minimum Weight ◽  
Time Algorithm ◽  
Interval Graph ◽  
Efficient Implementation ◽  
Maximum Weight ◽  
Circular Arc ◽  
Maximum Weight Clique

We consider problems on intervals which can be solved by dynamic programming. Specifically, we give an efficient implementation of dynamic programming on intervals. As an application, an optimal sequential partition of a graph G=(V, E) can be obtained in O(m log n) time, where n=|V| and m=|E|. We also present an O(n log n) time algorithm for finding a minimum weight dominating set of an interval graph G=(V, E), and an O(m log n) time algorithm for finding a maximum weight clique of a circular-arc graph G=(V, E), provided their intersection models of n intervals (arcs) are given.

scholarly journals A Complementary Pivoting Approach to the Maximum Weight Clique Problem

2002 ◽  
Vol 12 (4) ◽  
pp. 928-948 ◽  
Author(s):  
Alessio Massaro ◽  
Marcello Pelillo ◽  
Immanuel M. Bomze
Keyword(s):  
Maximum Weight ◽  
Complementary Pivoting ◽  
Maximum Weight Clique ◽  
Clique Problem

Clustered maximum weight clique problem: Algorithms and empirical analysis

2017 ◽  
Vol 85 ◽  
pp. 113-128 ◽  
Author(s):  
Krishna Teja Malladi ◽  
Snezana Mitrovic-Minic ◽  
Abraham P. Punnen
Keyword(s):  
Empirical Analysis ◽  
Maximum Weight ◽  
Maximum Weight Clique ◽  
Clique Problem

On graphs with polynomially solvable maximum-weight clique problem

Networks ◽  
1989 ◽  
Vol 19 (2) ◽  
pp. 247-253 ◽  
Author(s):  
Egon Balas ◽  
Chang Sung Yu
Keyword(s):  
Maximum Weight ◽  
Polynomially Solvable ◽  
Maximum Weight Clique ◽  
Clique Problem

scholarly journals Fast maximum weight clique extraction algorithm: Optimal tables for branch-and-bound

2017 ◽  
Vol 223 ◽  
pp. 120-134 ◽  
Author(s):  
Satoshi Shimizu ◽  
Kazuaki Yamaguchi ◽  
Toshiki Saitoh ◽  
Sumio Masuda
Keyword(s):  
Branch And Bound ◽  
Maximum Weight ◽  
Extraction Algorithm ◽  
Maximum Weight Clique
Sign in / Sign up

Export Citation Format

Share Document