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

Karolyi, G, Pach, J, Tardos, G and Toth, G (1997). An algorithm for finding many disjoint monochromatic edges in a complete 2-colored geometric graph. In: Intuitive Geometry. 5th Intuitive Geometry Conference - Intuitive Geometry, Budapest Hungary, (367-372). Sep 03-08, 1995.

Author Karolyi, G
Pach, J
Tardos, G
Toth, G
Title of paper An algorithm for finding many disjoint monochromatic edges in a complete 2-colored geometric graph
Conference name 5th Intuitive Geometry Conference - Intuitive Geometry
Conference location Budapest Hungary
Conference dates Sep 03-08, 1995
Proceedings title Intuitive Geometry
Journal name Intuitive Geometry
Publication Year 1997
Sub-type Fully published paper
ISBN 963-8022-89-2
ISSN 1217-4696
Volume 6
Start page 367
End page 372
Total pages 6
Language eng
Q-Index Code E1
Q-Index Status Provisional Code
Institutional Status Unknown

Document type: Conference Paper
Collection: ResearcherID Downloads
 
Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 3 times in Thomson Reuters Web of Science Article | Citations
Google Scholar Search Google Scholar
Created: Fri, 03 May 2013, 19:27:06 EST by System User