A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Optimization problems in dotted interval graphs
2014
Discrete Applied Mathematics
The class of D-dotted interval (D-DI) graphs is the class of intersection graphs of arithmetic progressions with jump (common difference) at most D. We consider various classical graph-theoretic optimization problems in D-DI graphs of arbitrarily, but fixed, D. We show that Maximum Independent Set, Minimum Vertex Cover, and Minimum Dominating Set can be solved in polynomial time in this graph class, answering an open question posed by Jiang (Inf. Processing Letters, 98(1): [29][30][31][32][33]
doi:10.1016/j.dam.2014.04.014
fatcat:xsvkydhd7zhtdopiw67bzidwjy