WinnSpace Repository

Richard Nowakowski

Richard Nowakowski

 

Recent Submissions

  • Currie, James; Nowakowski, Richard (Ars Combinatoria, 1991)
    A graph is called well-covered if every maximal independent set has the same size. One generalization of independent sets in graphs is that of a fractional cover -- attach nonnegative weights to the vertices and require ...

Search WinnSpace


Browse

My Account

Discover

RSS Feeds