2612 search results - page 20 / 523 » Switching Graphs and Their Complexity |
ANSS
2001
IEEE
14 years 1 months ago
2001
IEEE
In this work, we study the different buffering techniques used in the literature to solve the contention problem in A TM switching architectures. The objective of our study is to ...
INFOCOM
2010
IEEE
13 years 7 months ago
2010
IEEE
The use of network coding has been shown to improve throughput in input-queued multicast switches, but not without costs of computational complexity and delays. In this paper, we i...
CDC
2009
IEEE
14 years 1 months ago
2009
IEEE
This paper considers the controllability problem for multi-agent systems. In particular, the structural controllability of multi-agent systems with a single leader under switching ...
FAW
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...
EOR
2008
13 years 10 months ago
2008
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...