2612 search results - page 7 / 523 » Switching Graphs and Their Complexity |
SOFSEM
2009
Springer
14 years 4 months ago
2009
Springer
GLVLSI
1996
IEEE
13 years 11 months ago
1996
IEEE
AAI
2006
13 years 7 months ago
2006
BROADNETS
2006
IEEE
14 years 1 months ago
2006
IEEE
: With the increase of the number of wavelengths per fiber waveband switching has been proposed to decrease the number of switching ports in optical nodes. Another concept that of ...
IANDC
2010
13 years 6 months ago
2010
We show that the two NP-complete problems of Dodgson Score and Young Score have differing computational complexities when the winner is close to being a Condorcet winner. On the ...