built in a dxf file, 495.13mm x 371.34mm large, with 31.73mm margins on top and side, for the xochitl menubar.
Abstract: Cartesian graph bundles is a class of graphs that is a generalization of the Cartesian graph products. Let G be a kG-connected graph and D_c(G) denote the diameter of G after deleting any of ...
Abstract: The characterization of graph morphisms in terms of the subgraphs of the Cartesian graph product is extended and used to develop algorithms for an optimal graph monomorphism problem. The ...
In this paper, we propose a new data structure for approximate nearest neighbor search. This structure augments the neighborhood graph with a bridge graph. We propose to exploit Cartesian ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results