𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Lower bounds for combinatorial problems on graphs

✍ Scribed by Hiroyuki Nakayama; Takao Nishizeki; Nobuji Saito


Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
375 KB
Volume
6
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Lower bounds for arithmetic problems
✍ JoΓ£o MeidΓ’nis πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 543 KB
Lower bounds for on-line graph coloring
✍ Magnus M. HalldΓ³rsson; Mario Szegedy πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 771 KB