Abstract
An efficient reduction process for path problems on circular-arc graphs is introduced. For the parity path problem, this reduction gives anO(n+m) algorithm for proper circular-arc graphs, and anO(n+m) algorithm for general circular-arc graphs. This reduction also gives anO(n+m) algorithm for the two path problem on circular-arc graphs.
Similar content being viewed by others
References
Srinivasa R. Arikati and Uri N. Peled.A linear algorithm for group path problem on chordal graphs. Technical report, RRR No. 29–90, RUTCOR, June 1990.
D. Bienstock.On the complexity of testing for odd holes and induced odd paths. To appear in Discrete Mathematics.
M. A. Bonuccelli.Dominating sets and domatic number of circular-arc graphs. Discrete Appl. Maths., 12: 203–213, 1985.
G. A. Cypher.The k paths problem. PhD thesis, Yale University, 1980.
M. C. Golumbic.Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980.
Wen-Lian Hsu.Maximum weight clique algorithms for circular-arc graphs and circle graphs. SIAM Journal on Computing, 14: 224–231, 1985.
Wen-Lian Hsu.Recognizing planar perfect graphs. Journal of the ACM, 34: 255–288, 1987.
J. M. Keil.Finding hamiltonian circuits in interval graphis. Information Processing Letters, 20: 201–206, 1985.
S. V. Krishman, S. Seshadri and C. Pandu Rangan.A new linear algorithm for two path problem on chordal graphs. In Eighth FST and TCS, Pune, India, 1988.
G. K. Manacher, S. R. Arikati and Pandu Rangan C.Chord-free path problems on interval graphs. (submitted).
S. Masuda and K. Nakajima.An optimum algorithm for finding a maximum independent set of a circular-arc graph. SIAM Journal on Computing, 17: 41–52, 1988.
Y. Shiloach.A polynomial solution to the undirected two path problem. Journal of the ACM, 27: 445–456, 1980.
A. Tucker.An efficient test for circular-arc graphs. SIAM Journal on Computing, 9: 1–24, 1980.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Arikati, S.R., Pandu Rangan, C. & Manacher, G.K. Efficient reduction for path problems on circular-arc graphs. BIT 31, 181–193 (1991). https://doi.org/10.1007/BF01931279
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01931279