1952 search results - page 254 / 391 » Complete partitions of graphs |
145
click to vote
ASPDAC
2004
ACM
15 years 10 months ago
2004
ACM
- Minimum area is one of the important objectives in technology mapping for lookup table-based FPGAs. It has been proven that the problem is NP-complete. This paper presents a poly...
171
click to vote
CIAC
2006
Springer
15 years 10 months ago
2006
Springer
Virtual private network design in the hose model deals with the reservation of capacities in a weighted graph such that the terminals in this network can communicate with one anoth...
190
click to vote
FDL
2004
IEEE
15 years 10 months ago
2004
IEEE
The steadily increasing complexity of embedded systems requires comprehensive methodoloat support the design process from the highest possible abstraction level. In most of the cu...
138
click to vote
DAGSTUHL
2007
15 years 7 months ago
2007
Automated political districting shares with electronic voting the aim of preventing electoral manipulation and pursuing an impartial electoral mechanism. Political districting can...
154
click to vote
IJCAI
2001
15 years 7 months ago
2001
We study the impact of backbones in optimization and approximation problems. We show that some optimization problems like graph coloring resemble decision problems, with problem h...