2612 search results - page 187 / 523 » Switching Graphs and Their Complexity |
156
click to vote
TROB
2008
15 years 4 months ago
2008
Control of mobile networks raises fundamental and novel problems in controlling the structure of the resulting dynamic graphs. In particular, in applications involving mobile senso...
139
click to vote
FASE
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. The complexity of large system models in software engineering nowadays is mastered by using different views. View-based modeling aims at creating small, partial models, e...
146
click to vote
ICC
2007
IEEE
15 years 10 months ago
2007
IEEE
—An adaptive multiple input and multiple output with the code matrix index feedback [8]. One detector will (MIMO) system based on the unified belief propagation (BP) work in the ...
133
click to vote
COCO
2009
Springer
15 years 11 months ago
2009
Springer
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
144
click to vote
SIAMDM
2008
15 years 4 months ago
2008
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...