5100 search results - page 367 / 1020 » The Linear Complexity of a Graph |
168
click to vote
GD
2004
Springer
15 years 11 months ago
2004
Springer
Pinchasi and Radoiˇci´c [11] used the following observation to bound the number of edges of a topological graph without a self-crossing cycle of length 4: if we make a list of t...
166
Voted
VLDB
1993
ACM
15 years 10 months ago
1993
ACM
The enforcement of semantic integrity constraints in data and knowledge bases constitutea a major performance bottleneck. Integrity constraint simplification methods aim at reduci...
155
click to vote
APVIS
2004
15 years 7 months ago
2004
Two and a half dimensional graph visualisation is the stacking of a set of related graphs into the third dimension to support visual comparison. A new aesthetic criterion is intro...
122
click to vote
CAGD
2000
15 years 6 months ago
2000
Evaluation routines are essential for any application that uses triangular B-spline surfaces. This paper describes an algorithm to efficiently evaluate triangular B-spline surface...
173
click to vote
PC
2000
15 years 6 months ago
2000
The LogP model is a model of parallel computation that characterises a parallel computer system by four parameters: the latency L, the overhead o, the gap g and the number of proc...