A modified golumbic algorithm for permutation graphs in VLSI

In this paper, a modified Golumbic algorithm is presented to find the maximum set in a permutation graphs. The modified algorithm runs in O(n log n) times like the original algorithm[1], but some step timing O(n) in original algorithm is cut in the proposed method, then time consumption for solution is decreased by the modification. The example shows the anticipative result.