2612 search results - page 58 / 523 » Switching Graphs and Their Complexity |
CIE
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn't be solved by classifying it as being either NP-complete or solvabl...
CN
2006
13 years 10 months ago
2006
As buffer-less crossbar scheduling algorithms reach their practical limitations due to higher port numbers and data rates, internally buffered crossbar (IBC) switches have gained ...
JSAC
2006
13 years 10 months ago
2006
A new control algorithm for the multiplane baseline switching network is proposed in this paper. This algorithm chooses a plane for a new connection in such a way that this new con...
FCT
2009
Springer
14 years 4 months ago
2009
Springer
Entanglement is a complexity measure for directed graphs that was used to show that the variable hierarchy of the propositional modal µ-calculus is strict. While graphs of entangl...
ICC
2007
IEEE
14 years 4 months ago
2007
IEEE
– Optical burst switching (OBS) is a promising technique for next-generation optical switching networks. In traditional OBS, an entire burst is discarded when all output waveleng...