A decomposition approach for optimal processing of telecommunications and cyberspace systems

The large volumes of information that arise from telecommunications and cyberspace systems can be represented by massive digraphs. The size of these graphs are so huge that they are unable to be processed by current technologies. The graphs require new and innovative methods of processing and visualizing. Graph surfaces of hierarchical graph slices have been suggested as a way of representing massive digraphs. In this chapter an approach is presented which involves encoding Lipschitz functions into monotone k-logic functions using symmetric chain decompositions (SeD). This approach proposes to address some of the issues concerning huge graphs by providing memory minimization techniques that can be applied to storing graph surfaces.