2612 search results - page 7 / 523 » Switching Graphs and Their Complexity |
64
Voted
SOFSEM
2009
Springer
15 years 10 months ago
2009
Springer
103
Voted
GLVLSI
1996
IEEE
15 years 6 months ago
1996
IEEE
96
Voted
AAI
2006
15 years 1 months ago
2006
100
Voted
BROADNETS
2006
IEEE
15 years 8 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 ...
89
Voted
IANDC
2010
15 years 11 days 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 ...