7 search results - page 2 / 2 » Proximity drawings of binary trees in polynomial area |
CORR
2010
Springer
13 years 6 months ago
2010
Springer
We study methods for drawing trees with perfect angular resolution, i.e., with angles at each vertex, v, equal to 2/d(v). We show:
STOC
2006
ACM
14 years 6 months ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...