2125 search results - page 49 / 425 » On Graph Complexity |
GD
1998
Springer
13 years 12 months ago
1998
Springer
We describe a unified framework of aesthetic criteria and complexity measures for drawing planar graphs with polylines and curves. This framework includes several visual properties...
STOC
2002
ACM
14 years 8 months ago
2002
ACM
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
EJC
2007
13 years 7 months ago
2007
Abstract. Given a simplicial hyperplane arrangement H and a subspace arrangement A embedded in H, we define a simplicial complex ∆A,H as the subdivision of the link of A induced...
CHI
2007
ACM
14 years 8 months ago
2007
ACM
Designing mobile and wearable applications is a challenge. The context of use is more important than ever and traditional methodologies for elicitation and specification reach the...
SAS
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. While the tightest proven worst-case complexity for Andersen's points-to analysis is nearly cubic, the analysis seems to scale better on real-world codes. We examine...