A C++ implementation of a O(n log n) algorithm computing a maximal stable set of an interval graph - Archive ouverte HAL Access content directly
Software Year : 2021

A C++ implementation of a O(n log n) algorithm computing a maximal stable set of an interval graph

Sid Touati
  • Function : Author
  • PersonId : 962200

Abstract

This software implements the algorithm published in U.I. Gupta, D.T. Lee, J.-T Leung. An optimal solution for the channel-assignment problem; IEEE Transactions on Computers C-28(1979), 807-810. Citation of the authors: "Given a set of intervals (pairs of real numbers), we look at the problem of finding a minimal partition of this set such that no element of the partition contains two overlapping intervals. We exhibit a O (n log n) algorithm which is optimal. The problem has applications in LSI layout design and job scheduling". And I add that this algorithm solves also some problems in register allocation inside compilers.
68 View
9 Download

Share

Gmail Mastodon Facebook X LinkedIn More