On Partitioning Interval and Circular-Arc Graphs into Proper Interval Subgraphs with Applications-Reference-Cited by-同舟云学术

On Partitioning Interval and Circular-Arc Graphs into Proper Interval Subgraphs with Applications

Published:2004 Issue: Volume: Page:129-140
ISSN:0302-9743
Container-title:LATIN 2004: Theoretical Informatics
language:
Short-container-title:

Author:

Gardi Frédéric

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-24698-5_17

Reference13 articles.

1. Andrews, M.G., Atallah, M.J., Chen, D.Z., Lee, D.T.: Parallel algorithms for maximum matching in complements of interval graphs and related problems. Algorithmica 26, 263–289 (2000)

2. Bodlaender, H.L., Jansen, K.: Restrictions of graph partition problems. Part I. Theoretical Computer Science 148, 93–109 (1995)

3. Corneil, D.G., Kim, H., Natarajan, S., Olariu, S., Sprague, A.: Simple linear time recognition of unit interval graphs. Information Processing Letters 55, 99–104 (1995)

4. Corneil, D.G., Olariu, S., Stewart, L.: The ultimate interval graph recognition algorithm? In: Proc. 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 175–180. ACM Publications, New York (1998)

5. Lecture Notes in Computer Science;F. Gardi,2003

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

1. On partitioning interval graphs into proper interval subgraphs and related problems;Journal of Graph Theory;2010-11-12

2. SUB-COLORING AND HYPO-COLORING INTERVAL GRAPHS;Discrete Mathematics, Algorithms and Applications;2010-09

3. Sub-coloring and Hypo-coloring Interval Graphs;Graph-Theoretic Concepts in Computer Science;2010