Abstract
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 (SCD). 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Martin Dodge and Rob Kitchen,(2001), Mapping Cyberspace, Routledge, London, New York.
James Abello, Panos M. Pardalos and Mauricio G.C. Resende, (1999), On Maximum Clique Problems in Very Large Graphs, in External Memory Algorithms, J. Abello and J. Vitter (Eds.), AMSDIMACS Series on Discrete Mathematics and Theoretical Computer Science, Vol. 50.
James Abello, Jeffrey Korn, Matthias Kreuseler, (2002), Navigating Giga-Graphs, AVI 2002 Advanced Visual Interfaces, Trento, Italy, pp. 22–24.
James Abello, Shankar Krishnan, (1999), Navigating Graph Surfaces, Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems, Panos Pardalos (Ed.), Kluwer Academic Publisher, Dordrecht, Boston, London, pp. 1–16.
James Abello and Jeffrey Korn, Visualizing Massive Multi-digraphs, IEEE Information Visualization 2000, Salt Lake City, UT, October 2000, pp. 39–48.
Vincenzo Loia, Masoud Nikravesh and Lotfi A. Zadeh (2001), Call for papers Journal of Soft Computing Special Issue Fuzzy Logic and the Internet, http://bisc7.eecs.berkeley.edu/BISC/flint2001/SCJ_FLINT2001.pdf
James Abello, Panos M. Pardalos and Mauricio G.C. Resende, (Eds.), (2002), Handbook of Massive Data Sets, Book Series: Massive Computing: Volume 4, Kluwer Academic Publishers, Dordrecht.
Lada A. Adamic, (1999), The Small World Web, Proc. 3rd European Conf. Research and Advanced Technology for Digital Libraries, ECDL, S. Abiteboul and A.-M. Vercoustre, Eds., number 1696 in Lecture Notes in Computer Science, LNCS, Springer-Verlag.
Réka Albert, Hawoong Jeong, and Albert-Laszló Barabâsi, (1999), Diameter of the world wide web, Nature 401, pp. 130–131.
Albert-Laszló Barabâsi, Réka Albert and Hawoong Jeong, (2000), Scale-free characteristics of random networks: The topology of the world wide web, Physica A, 281, pp. 69–77.
Albert-Laszló Barabâsi and Réka Albert, (1999), Emergence of Scaling in Random Networks, Science, Vol. 286 Oct. pp. 509–512.
Victor Korotkich, (1989), Multilevel Dichotomy Algorithm in Global Optimization, Lecture Notes in Control and Information Sciences, M Thoma and A. Wyner (Eds.), Springer-Verlag, pp. 161–169.
Yu. G. Evtushenko, M. A. Potapov, V. Korotkich, (1992), Numerical Methods for Global Optimization, Recent Advances in Global Optimization, Edited by P. Pardalos and C. Floudas, Princeton Series in Computer Science, Princeton University Press, pp. 274–297.
G. Hansel, (1966), Sur le nombre des fonctions Boolenes monotones den variables, C.R. Acad. Sci. Paris 262, no. 20, pp. 1088–1090.
R. P. Dilworth, (1950), A Decomposition Theorem for Partially Ordered Sets, Annals of Mathematics, Vol. 51, No. 1, January, pp. 161–166.
N.G. De Bruijn, CA. Van Ebbenhorst Tengbergen and D. Kruyswijk, (1952), On the Set of Divisors of a Number, Nieuw. Arch. Wisk., vol. 23, No. 2, pp. 191–193.
A. N. Kolmogorov and V. M. Tihomirov, (1959), ε-Entropy and capacity of sets in functional spaces, Uspehi Mat. Nauk 14, No. 2, pp. 3–86;
American Mathematical Society, (1961), Translation 17, No. 2, pp. 277–364.
H.O. Peitgen, and D. Saupe, (Eds.), (1988), The Science of Fractal Images, Springer-Verlag, New York, p. 284.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Kluwer Academic Publishers
About this chapter
Cite this chapter
Korotkikh, V., Patson, N. (2003). A Decomposition Approach for Optimal Processing of Telecommunications and Cyberspace Systems. In: Pardalos, P.M., Korotkikh, V. (eds) Optimization and Industry: New Frontiers. Applied Optimization, vol 78. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-0233-9_13
Download citation
DOI: https://doi.org/10.1007/978-1-4613-0233-9_13
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7953-9
Online ISBN: 978-1-4613-0233-9
eBook Packages: Springer Book Archive