An evolutionary edge of knowing less (or: On the ‘curse’ of global information)
✍ Scribed by Oded Stark; Doris A. Behrens
- Publisher
- Springer-Verlag
- Year
- 2009
- Tongue
- English
- Weight
- 375 KB
- Volume
- 20
- Category
- Article
- ISSN
- 0936-9937
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
If you're craving a stiff dose of adventure set on the freezing-cold fringes of human civilization, check out *On the Edge of the Arctic* by H.L. Sayler. Packed with plenty of action and intrigue, this well-paced tale is sure to please readers in every age group.
We show that an n-vertex bipartite K 3,3 -free graph with n 3 has at most 2n -4 edges and that an n-vertex bipartite K 5 -free graph with n 5 has at most 3n -9 edges. These bounds are also tight. We then use the bound on the number of edges in a K 3,3 -free graph to extend two known NC algorithms fo