[图书][B] On graph-transverse matching problems
RW Churchley - 2012 - search.proquest.com
Given graphs G, H, is it possible to find a matching which, when deleted from G, destroys all
copies of H? The answer is obvious for some inputs—notably, when G is a large complete …
copies of H? The answer is obvious for some inputs—notably, when G is a large complete …
[PDF][PDF] College Prep Teaching Modules--A New Viewpoint
RH Varney - 2012 - core.ac.uk
Research shows that mathematics education in the United States is struggling to keep up
with the rapid growth in Science, Technology, Engineering, and Math (STEM) career …
with the rapid growth in Science, Technology, Engineering, and Math (STEM) career …
Teaching the art of computer programming (TAOCP)
F Ruskey - Proceedings of the 16th Western Canadian …, 2011 - dl.acm.org
Donald Knuth's magnum opus, The Art of Computer Programming (TAOCP), is often bought,
frequently cited, sometimes browsed, occasionally read, but almost never used for teaching …
frequently cited, sometimes browsed, occasionally read, but almost never used for teaching …