5 research outputs found
Tight bounds on adjacency labels for monotone graph classes
A class of graphs admits an adjacency labeling scheme of size , if the
vertices in each of its -vertex graphs can be assigned binary strings
(called labels) of length so that the adjacency of two vertices can be
determined solely from their labels.
We give tight bounds on the size of adjacency labels for every family of
monotone (i.e., subgraph-closed) classes with a well-behaved growth function
between and for any .
Specifically, we show that for any function
satisfying for any fixed , and some~sub-multiplicativity condition, there are monotone graph classes
with growth that do not admit adjacency labels of size at most
. On the other hand, any such class does admit adjacency labels of
size . Surprisingly this tight bound is a
factor away from the information-theoretic bound of . The special
case when implies that the recently-refuted Implicit Graph
Conjecture [Hatami and Hatami, FOCS 2022] also fails within monotone classes.
We further show that the Implicit Graph Conjecture holds for all monotone
\emph{small} classes. In other words, any monotone class with growth rate at
most for some constant , admits adjacency labels of
information-theoretic order optimal size. In fact, we show a more general
result that is of independent interest: any monotone small class of graphs has
bounded degeneracy.We conjecture that the Implicit Graph Conjecture holds for
all hereditary small classes.Comment: New result added (monotone small classes have bounded degeneracy -
thus an implicit representation). 22 pages, 1 figur
Heuristics for Sparsest Cut Approximations in Network Flow Applications
The Maximum Concurrent Flow Problem (MCFP) is a polynomially bounded problem that has been used over the years in a variety of applications. Sometimes it is used to attempt to find the Sparsest Cut, an NP-hard problem, and other times to find communities in Social Network Analysis (SNA) in its hierarchical formulation, the HMCFP. Though it is polynomially bounded, the MCFP quickly grows in space utilization, rendering it useful on only small problems. When it was defined, only a few hundred nodes could be solved, where a few decades later, graphs of one to two thousand nodes can still be too much for modern commodity hardware to handle.
This dissertation covers three approaches to heuristics to the MCFP that run significantly faster in practice than the LP formulation with far less memory utilization. The first two approaches are based on the Maximum Adjacency Search (MAS) and apply to both the MCFP and the HMCFP used for community detection. We compare the three approaches to the LP performance in terms of accuracy, runtime, and memory utilization on several classes of synthetic graphs representing potential real-world applications. We find that the heuristics are often correct, and run using orders of magnitude less memory and time
Improved Classical Cryptanalysis of SIKE in Practice
Item does not contain fulltextPKC 202
A lightweight, graph-theoretic model of class-based similarity to support object-oriented code reuse.
The work presented in this thesis is principally concerned with the development of a method and set of tools designed to support the identification of class-based similarity in collections of object-oriented code. Attention is focused on enhancing the potential for software reuse in situations where a reuse process is either absent or informal, and the characteristics of the organisation are unsuitable, or resources unavailable, to promote and sustain a systematic approach to reuse. The approach builds on the definition of a formal, attributed, relational model that captures the inherent structure of class-based, object-oriented code. Based on code-level analysis, it relies solely on the structural characteristics of the code and the peculiarly object-oriented features of the class as an organising principle: classes, those entities comprising a class, and the intra and inter-class relationships existing between them, are significant factors in defining a two-phase similarity measure as a basis for the comparison process. Established graph-theoretic techniques are adapted and applied via this model to the problem of determining similarity between classes. This thesis illustrates a successful transfer of techniques from the domains of molecular chemistry and computer vision. Both domains provide an existing template for the analysis and comparison of structures as graphs. The inspiration for representing classes as attributed relational graphs, and the application of graph-theoretic techniques and algorithms to their comparison, arose out of a well-founded intuition that a common basis in graph-theory was sufficient to enable a reasonable transfer of these techniques to the problem of determining similarity in object-oriented code. The practical application of this work relates to the identification and indexing of instances of recurring, class-based, common structure present in established and evolving collections of object-oriented code. A classification so generated additionally provides a framework for class-based matching over an existing code-base, both from the perspective of newly introduced classes, and search "templates" provided by those incomplete, iteratively constructed and refined classes associated with current and on-going development. The tools and techniques developed here provide support for enabling and improving shared awareness of reuse opportunity, based on analysing structural similarity in past and ongoing development, tools and techniques that can in turn be seen as part of a process of domain analysis, capable of stimulating the evolution of a systematic reuse ethic