AnO(m+nlogn) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs-Reference-Cited by-同舟云学术

AnO(m+nlogn) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs

Published:1997-11 Issue:2 Volume:25 Page:336-358
ISSN:0196-6774
Container-title:Journal of Algorithms
language:en
Short-container-title:Journal of Algorithms

Author:

Bhattacharya Binay K.,Kaller Damon

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computational Mathematics,Control and Optimization

Reference15 articles.

1. S. G. Akl, B. K. Bhattacharya, D. Kaller, 1994, Optimal Parallel Algorithm for the Maximum Clique Problem in a Family of Proper Circular Arcs, Centre for Systems Science, Simon Fraser University

2. Finding maximum cliques on circular-arc graphs;Apostolico;Inform. Process. Lett.,1987

3. Dynamic programming on intervals;Asano;Internat. J. Comput. Geom. Appl.,1993

4. Parallel algorithms on circular-arc graphs;Bertossi;Inform. Process. Lett.,1990

5. A linear algorithm for maximum cliques in proper circular-arc graphs;Bhattacharya;SIAM J. Discrete Math.,1996

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Stable Set Problem: Branch & Cut Algorithms;Encyclopedia of Optimization;2024

2. Avoidable vertices and edges in graphs: Existence, characterization, and applications;Discrete Applied Mathematics;2022-03

3. Succinct Encodings for Families of Interval Graphs;Algorithmica;2020-04-25

4. Solving the Maximum Clique Problem using a Hybrid Particle Swarm Optimization Algorithm;International Journal of Operations Research and Information Systems;2018-10

5. Interval Routing Schemes for Circular-Arc Graphs;International Journal of Foundations of Computer Science;2017-01