2612 search results - page 107 / 523 » Switching Graphs and Their Complexity |
118
click to vote
PODC
2011
ACM
14 years 23 days ago
2011
ACM
This work studies decision problems from the perspective of nondeterministic distributed algorithms. For a yes-instance there must exist a proof that can be verified with a distri...
COMSIS
2010
14 years 7 months ago
2010
The concept of complexity is used in many areas of computer science and software engineering. Software complexity metrics can be used to evaluate and compare quality of software de...
ICC
2007
IEEE
15 years 1 months ago
2007
IEEE
This paper reports on a promising approach for solving problems found when Multi Protocol Label Switching (MPLS), soon to be a dominant protocol, is used in core network systems. D...
115
click to vote
ISCA
2012
IEEE
13 years 10 days ago
2012
IEEE
—As the scales of parallel applications and platforms increase the negative impact of communication latencies on performance becomes large. Fortunately, modern High Performance C...
WG
2005
Springer
15 years 3 months ago
2005
Springer
To decide whether a line graph (hence a claw-free graph) of maximum degree five admits a stable cutset has been proven to be an NP-complete problem. The same result has been known...