Summary: Node importance in complex networks is evaluated by taking comprehensively the local and global property of nodes into consideration. Two algorithms are given to determine the node importance: one is based on neighborhood and the other is based on key field. The former algorithm could be used to decrease the computational complexity efficiently and the latter efficiently characterize the node importance and suit to weighted graph. Finally, the validity of these two algorithms is verified by giving an example.