Infoscience

Book Chapter

An algorithm for finding many disjoint monochromatic edges in a complete 2-colored geometric graph

    Note:

    Professor Pach's number: [116]

    Reference

    • DCG-CHAPTER-2008-015

    Record created on 2008-11-18, modified on 2016-08-08

Related material