Keil J. Mark

J. Mark Keil

Information about the author J. Mark Keil will soon be added to the site.
Found 2 papers in total
On the complexity of scheduling tasks with discrete starting times
On the complexity of scheduling tasks with discrete starting times
1992
The paper considers the problem of scheduling tasks with a discrete set of possible...
An optimal algorithm for finding dominating cycles in circular-arc graphs
An optimal algorithm for finding dominating cycles in circular-arc graphs
1992
A subset D of the vertices of a graph is a dominating cycle if (i) every vertex not in...
Papers per page: