2612 search results - page 92 / 523 » Switching Graphs and Their Complexity |
152
click to vote
IWCMC
2006
ACM
15 years 10 months ago
2006
ACM
Designing and planning of the switching, signaling and support network is a fairly complex process in cellular mobile network. In this paper, the problem of assigning cells to swi...
115
click to vote
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
High-radix switches are desirable building blocks for large computer interconnection networks, because they are more suitable to convert chip I/O bandwidth into low latency and lo...
124
Voted
SECURWARE
2008
IEEE
15 years 10 months ago
2008
IEEE
Trust network analysis with subjective logic (TNA-SL) simplifies complex trust graphs into series-parallel graphs by removing the most uncertain paths to obtain a canonical graph...
127
click to vote
VISSOFT
2005
IEEE
15 years 9 months ago
2005
IEEE
Dominance analysis from graph theory allows one to locate subordinated software elements in a rooted dependency graph. It identifies the nesting structure for a dependency graph ...
118
click to vote
FSTTCS
2005
Springer
15 years 9 months ago
2005
Springer
We investigate the s-t-connectivity problem for directed planar graphs, which is hard for L and is contained in NL but is not known to be complete. We show that this problem is log...