Sciweavers

265 search results - page 23 / 53
» The independence number in graphs of maximum degree three
Sort
View
WG
2004
Springer
15 years 3 months ago
The Computational Complexity of the Minimum Weight Processor Assignment Problem
In portable multimedia systems a number of communicating tasks has to be performed on a set of heterogeneous processors. This should be done in an energy-efficient way. We give th...
Hajo Broersma, Daniël Paulusma, Gerard J. M. ...
IWPEC
2009
Springer
15 years 4 months ago
Boolean-Width of Graphs
Abstract. We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods across a cut of a graph. For many graph problems this number is...
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshel...
SWAT
1994
Springer
113views Algorithms» more  SWAT 1994»
15 years 1 months ago
Trapezoid Graphs and Generalizations, Geometry and Algorithms
Trapezoid graphs are a class of cocomparability graphs containing interval graphs and permutation graphs as subclasses. They were introduced by Dagan, Golumbic and Pinter DGP]. Th...
Stefan Felsner, Rudolf Müller, Lorenz Wernisc...
116
Voted
CORR
2010
Springer
338views Education» more  CORR 2010»
14 years 9 months ago
Optimal Distributed P2P Streaming under Node Degree Bounds
We study the problem of maximizing the broadcast rate in peer-to-peer (P2P) systems under node degree bounds, i.e., the number of neighbors a node can simultaneously connect to is ...
Shaoquan Zhang, Ziyu Shao, Minghua Chen
BMCBI
2006
118views more  BMCBI 2006»
14 years 9 months ago
Low degree metabolites explain essential reactions and enhance modularity in biological networks
Background: Recently there has been a lot of interest in identifying modules at the level of genetic and metabolic networks of organisms, as well as in identifying single genes an...
Areejit Samal, Shalini Singh, Varun Giri, Sandeep ...