scholarly journals Solving the path cover problem on circular-arc graphs by using an approximation algorithm

2006 ◽  
Vol 154 (1) ◽  
pp. 76-105 ◽  
Author(s):  
Ruo-Wei Hung ◽  
Maw-Shang Chang
Keyword(s):  
Approximation Algorithm ◽  
Circular Arc ◽  
Path Cover ◽  
Cover Problem ◽  
Circular Arc Graphs

scholarly journals A 6/5-approximation algorithm for the maximum 3-cover problem

2011 ◽  
Vol 25 (1) ◽  
pp. 60-77
Author(s):  
Ioannis Caragiannis ◽  
Gianpiero Monaco
Keyword(s):  
Approximation Algorithm ◽  
Cover Problem

Linear algorithm for optimal path cover problem on interval graphs

1990 ◽  
Vol 35 (3) ◽  
pp. 149-153 ◽  
Author(s):  
Srinivasa Rao Arikati ◽  
C. Pandu Rangan
Keyword(s):  
Optimal Path ◽  
Interval Graphs ◽  
Linear Algorithm ◽  
Path Cover ◽  
Cover Problem

scholarly journals A time-optimal solution for the path cover problem on cographs

2003 ◽  
Vol 290 (3) ◽  
pp. 1541-1556 ◽  
Author(s):  
Koji Nakano ◽  
Stephan Olariu ◽  
Albert Y. Zomaya
Keyword(s):  
Optimal Solution ◽  
Path Cover ◽  
Time Optimal ◽  
Cover Problem

Surjective L (2, 1)-labeling of cycles and circular-arc graphs

2018 ◽  
Vol 35 (1) ◽  
pp. 739-748 ◽  
Author(s):  
Sk. Amanathulla ◽  
Madhumangal Pal
Keyword(s):  
Circular Arc ◽  
Circular Arc Graphs

An $O(n^2 )$ Algorithm for Coloring Proper Circular Arc Graphs

1981 ◽  
Vol 2 (2) ◽  
pp. 88-93 ◽  
Author(s):  
James B. Orlin ◽  
Maurizio A. Bonuccelli ◽  
Daniel P. Bovet
Keyword(s):  
Circular Arc ◽  
Circular Arc Graphs ◽  
Proper Circular Arc Graphs
Sign in / Sign up

Export Citation Format

Share Document