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
1997
Download
Formats
Format
BibTeX
MARC
MARCXML
DublinCore
EndNote
NLM
RefWorks
RIS

Files

Details

Title An algorithm for finding many disjoint monochromatic edges in a complete 2-colored geometric graph
Author(s) Pach, János ; Károlyi, G. ; Tardos, Gábor ; Tóth, Géza
Published in Intuitive Geometry
Series Bolyai Society mathematical studies, 6
Pages 367-372
Date 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
Work outside EPFL
Book chapters
Published

Actions

Preview