1056 search results - page 163 / 212 » Constraint-Based Graph Matching |
HPDC
1998
IEEE
14 years 1 months ago
1998
IEEE
Heterogeneous network-based systems are emerging as attractive computing platforms for HPC applications. This paper discusses fundamental research issues that must be addressed to...
ESOP
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. In a functional language, the dominant control-flow mechanism is function call and return. Most higher-order flow analyses, including k-CFA, do not handle call and retu...
COMPLEX
2009
Springer
14 years 1 months ago
2009
Springer
Creating ensembles of random but "realistic" topologies for complex systems is crucial for many tasks such as benchmark generation and algorithm analysis. In general, exp...
STACS
2000
Springer
14 years 19 days ago
2000
Springer
We clarify the computational complexity of planarity testing, by showing that planarity testing is hard for L, and lies in SL. This nearly settles the question, since it is widely...
WADS
1995
Springer
14 years 18 days ago
1995
Springer
We consider the problem of obtaining “nice” quadrangulations of planar sets of points. For many applications “nice” means that the quadrilaterals obtained are convex if po...