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

Authors:
W.-K. Shih;W.-L. Hsu
Affiliations:
-;-
Venue:
Information Processing Letters
Year:
1989

Citing 0
Cited 2

A New Technique for Optimization Problems in Graph Theory

IEEE Transactions on Computers
Algorithms for clique-independent sets on subclasses of circular-arc graphs

Discrete Applied Mathematics - Special issue: Traces of the Latin American conference on combinatorics, graphs and applications: a selection of papers from LACGA 2004, Santiago, Chile

Quantified Score

Hi-index	0.89

Visualization

Abstract