Given an undirected graph with weight for each vertex, the maximum weight clique problem is to find the clique of the maximum weight. Ã–stergÃ¥rd proposed a fast exact algorithm for solving thisâ€¦ (More)

The problem of embedding a graph in the plane with the minimum number of edge crossings arises in some circuit layout problems. It has been known to be NP-hard in general. Recently, in the area ofâ€¦ (More)

Time analog-to-digital converters (TADs) based on the power-supply voltage dependence of CMOS gate propagation delay time can be constructed solely of CMOS digital circuits and are characterized byâ€¦ (More)

Some fast exact algorithms for the maximum weight clique problem have been proposed. Ã–stergÃ¥rdâ€™s algorithm is one of them. Kumlander says his algorithm is faster than it. But we confirmed that theâ€¦ (More)

Nearest neighbour (NN) searches and k nearest neighbour (k-NN) searches are widely used in pattern recognition and image retrieval. An NN (k-NN) search finds the closest object (closest k objects) toâ€¦ (More)

A new algorithm is presented for finding a maximum independent set of a circular-arc graph. When the .graph is given in the form of a family of n arcs, our algorithm requires only O(n. log n) timeâ€¦ (More)

This paper describes a graph theoretic algorithm which, given a particular layout, finds a layer assignment that requires the minimum number of vias. The time complexity of the algorithm is &Ogr;(n3)â€¦ (More)