Efficient reduction for path problems on circular-arc graphs-Reference-Cited by-同舟云学术

Efficient reduction for path problems on circular-arc graphs

Published:1991-06 Issue:2 Volume:31 Page:181-193
ISSN:0006-3835
Container-title:BIT
language:en
Short-container-title:BIT

Author:

Arikati Srinivasa R.,Pandu Rangan C.,Manacher Glenn K.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Mathematics,Computer Networks and Communications,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01931279.pdf

Reference13 articles.

1. 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.

2. D. Bienstock.On the complexity of testing for odd holes and induced odd paths. To appear in Discrete Mathematics.

3. M. A. Bonuccelli.Dominating sets and domatic number of circular-arc graphs. Discrete Appl. Maths., 12: 203–213, 1985.

4. G. A. Cypher.The k paths problem. PhD thesis, Yale University, 1980.

5. M. C. Golumbic.Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980.

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

1. Large Induced Subgraphs via Triangulations and CMSO;SIAM Journal on Computing;2015-01

2. Finding Induced Paths of Given Parity in Claw-Free Graphs;Algorithmica;2010-11-09

3. Finding Induced Paths of Given Parity in Claw-Free Graphs;Graph-Theoretic Concepts in Computer Science;2010

4. Even and odd pairs in comparability and in P4-comparability graphs;Discrete Applied Mathematics;1999-01

5. The parity path problem on some subclasses of perfect graphs;Discrete Applied Mathematics;1996-07