Computing the Weighted Isolated Scattering Number of Interval Graphs in Polynomial Time

Algorithm 1

Algorithm minimal local cuts.

Input: An interval graph and its interval representation. Let with represented by

for . Furthermore, let all and be distinct.

Output: Minimal local cuts

Data structure: end-points of type record containing two fields,

value: real and

1 begin

2Construct records of type end-points , as follows;

3 for    do

4.value ;  .att left;

5.value ;  .att right;

6 end

7Sort in non-decreasing order using value as key. Let the sorted form be ;

8; ; .value;

9 for   to   do

10 if  .att=left and .att= right and .value  then

11;

12;

13

14end

15 end

16 end