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

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

Pach, János ; Károlyi, G. ; Tardos, Gábor ; Tóth, Géza

Year:
1997
Publisher:
Berlin, Springer
Note:
Professor Pach's number: [116]
Laboratories:
DCG

Record appears in:
Scientific production and competences > SB - School of Basic Sciences > MATH - Institute of Mathematics > DCG - Chair of Combinatorial Geometry
Scientific production and competences > SB - School of Basic Sciences > Mathematics
Publicly available
Work outside EPFL
Book chapters
Published



 Record created 2008-11-18, last modified 2018-03-17

n/a:
geomramalg - Download fulltextPDF
geomramalg1 - Download fulltextPS
Rate this document:

Rate this document:
1
2
3
4
5
 
(Not yet reviewed)