Improved bounds on planar k-sets and k-levels

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 1997, Pages 156-161

  Dey, Tamal K ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY   (India)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; TREES (MATHEMATICS);

K CONVEX POLYGONS; PARAMETRIC MATROIDS; PARAMETRIC MIMIMUM SPANNING TREES;

SET THEORY;

EID: 0031372629     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (29)