Approximating minimum coloring and maximum independent set in dotted interval graphs

Authors:
Minghui Jiang
Affiliations:
Department of Computer Science, Utah State University, Logan, UT
Venue:
Information Processing Letters
Year:
2006

Citing 2
Cited 1

An optimal algorithm for finding a maximum independent set of a circular-arc graph

SIAM Journal on Computing
Dotted interval graphs and high throughput genotyping

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms

Approximation algorithm for coloring of dotted interval graphs

Information Processing Letters

Quantified Score

Hi-index	0.89

Visualization

Abstract

Recently, S. Müller developed a generalized Atkin algorithm for computing square roots, which requires two exponentiations in finite fields GF(q) when q ≡ 9 (mod 16). In this paper, we present a simple improvement to it and the ...