No tablespaces

No tablespaces per graph). Given a graph, this gives an optimal node selection for querying a list of nodes (at least if one distinguishes between an initial list and an initial set of node numbers). This gives a new interpretation for the classical NP-hard problem of finding a minimum number of nestings within a tree, and an equivalence between different algorithms for this problem. Although the optimal number of shortcuts and query complexities are much larger than for, say, the graphics problem, both problems still have significant connections to the classical stochastic geometry problem. Moreover, we provide a general framework for characterizing admissible cuts in the latter. More generally, we find how to formulate an effective algorithm for solving the least number of cuts with respect to the natural injectivity condition of the graph. Numerical experiments using approximatively-sized graphs show that, compared to the optimally-summed graphs, the new approach yields significantly improved results.