Sciweavers

2487 search results - page 119 / 498
» Partitions of Graphs into Trees
Sort
View
INFOCOM
2003
IEEE
15 years 3 months ago
Optimal Partition of QoS Requirements for Many-to-Many Connections
— We study problems related to supporting multicast connections with Quality of Service (QoS) requirements. We investigate the problem of optimal resource allocation in the conte...
Dean H. Lorenz, Ariel Orda, Danny Raz
AUTOMATICA
2010
129views more  AUTOMATICA 2010»
14 years 10 months ago
Stability analysis for multi-agent systems using the incidence matrix: Quantized communication and formation control
The spectral properties of the incidence matrix of the communication graph are exploited to provide solutions to two multiagent control problems. In particular, we consider the pr...
Dimos V. Dimarogonas, Karl Henrik Johansson
GC
2008
Springer
14 years 10 months ago
Laplacian Spectrum of Weakly Quasi-threshold Graphs
In this paper we study the class of weakly quasi-threshold graphs that are obtained from a vertex by recursively applying the operations (i) adding a new isolated vertex, (ii) addi...
R. B. Bapat, A. K. Lal, Sukanta Pati
CORR
2010
Springer
73views Education» more  CORR 2010»
14 years 8 months ago
Spectrally degenerate graphs: Hereditary case
It is well known that the spectral radius of a tree whose maximum degree is ∆ cannot exceed 2 √
Zdenek Dvorak, Bojan Mohar
SIAMJO
2008
175views more  SIAMJO 2008»
14 years 10 months ago
On Bin Packing with Conflicts
Abstract. We consider the offline and online versions of a bin packing problem called bin packing with conflicts. Given a set of items V = {1, 2, . . . , n} with sizes s1, s2 . . ....
Leah Epstein, Asaf Levin