Conversion of coloring algorithms into maximum weight independent set algorithms
Discrete Applied Mathematics
Minimum cost and list homomorphisms to semicomplete digraphs
Discrete Applied Mathematics
Conversion of coloring algorithms into maximum weight independent set algorithms
Discrete Applied Mathematics
Communication: Minimum cost and list homomorphisms to semicomplete digraphs
Discrete Applied Mathematics
Minimizing area and power of sequential CMOS circuits using threshold decomposition
Proceedings of the International Conference on Computer-Aided Design
| Hi-index | 0.00 |