3008 search results - page 599 / 602 » Independence in connected graphs |
BMCBI
2007
13 years 7 months ago
2007
Background: In recent years, an extensive characterization of network structures has been made in an effort to elucidate design principles of metabolic networks, providing valuabl...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
A tree decomposition of the coordinates of a code is a mapping from the coordinate set to the set of vertices of a tree. A tree decomposition can be extended to a tree realization,...
SIGMETRICS
2008
ACM
13 years 7 months ago
2008
ACM
Getting new security features and protocols to be widely adopted and deployed in the Internet has been a continuing challenge. There are several reasons for this, in particular ec...
TOPLAS
2008
13 years 7 months ago
2008
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
JSA
2000
13 years 7 months ago
2000
Scheduling DAGs with communication times is the theoretical basis for achieving efficient parallelism on distributed memory systems. We generalize Graham's task-level in a ma...