Title :
A modified golumbic algorithm for permutation graphs in VLSI
Author :
Huang, Xiaodi ; Wang, Gaofeng
Author_Institution :
Wuhan Univ., Wuhan
Abstract :
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.
Keywords :
VLSI; graph theory; VLSI; maximum set; modified golumbic algorithm; permutation graphs; step timing; time consumption; Algorithm design and analysis; Physics computing; Polynomials; Timing; Very large scale integration; permutation graph independent clique;
Conference_Titel :
ASIC, 2007. ASICON '07. 7th International Conference on
Conference_Location :
Guilin
Print_ISBN :
978-1-4244-1132-0
Electronic_ISBN :
978-1-4244-1132-0
DOI :
10.1109/ICASIC.2007.4415611
