723 search results - page 63 / 145 » On the hyperbolicity constant in graphs |
162
click to vote
COMPGEOM
2006
ACM
16 years 7 days ago
2006
ACM
This paper addresses the problem of representing the connectivity information of geometric objects using as little memory as possible. As opposed to raw compression issues, the fo...
175
click to vote
PLDI
1993
ACM
15 years 10 months ago
1993
ACM
Program analysis and optimizationcan be speeded upthrough the use of the dependence flow graph (DFG), a representation of program dependences which generalizes def-use chains and...
179
click to vote
CATS
2006
15 years 7 months ago
2006
We consider the following clustering problems: given a general undirected graph, partition its vertices into disjoint clusters such that each cluster forms a clique and the number...
170
click to vote
CPC
2006
15 years 6 months ago
2006
We consider instances of the maximum independent set problem that are constructed according to the following semirandom model. Let Gn,p be a random graph, and let S be a set consis...
177
click to vote
TCS
2008
15 years 6 months ago
2008
This paper addresses the problem of representing the connectivity information of geometric objects using as little memory as possible. As opposed to raw compression issues, the fo...