The maximum gain of increasing the number of preemptions in multiprocessor scheduling
✍ Scribed by Kamilla Klonowska; Lars Lundberg; Håkan Lennerstad
- Publisher
- Springer-Verlag
- Year
- 2009
- Tongue
- English
- Weight
- 329 KB
- Volume
- 46
- Category
- Article
- ISSN
- 0001-5903
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
A subset of vertices is a maximum independent set if no two of the vertices are joined by an edge and the subset has maximum cardinality. In this paper we answer a question posed by Herb Wilf. We show that the greatest number of maximum independent sets for a tree of n vertices is 2(n-3\* for odd n
Denote the number of vertices of G by ]G[. A clique of graph G is a maximal complete subgraph. The density oJ(G) is the number of vertices in the largest clique of G. If ¢o(G)>~½ ]GI, then G has at most 2 t°l-'cG) cliques. The extremal graphs are then examined as wen. ## Terminology We will be co