The problem of explicitly constructing Ramsey graphs, i.e graphs that do not have a large clique or independent set is considered. We provide an elementary construction of a graph with the property that there is no clique or independent set of t of nodes, while the graph size is t p log log t log log log t . The construction is based on taking the product of all graphs in a distribution that is...

In [1] using a column construction technique it is proved that every interval graph can be colored online with First Fit with at most 8w(G) colors, where w(G) is the size of the maximum clique of G. Since the column construction can not be adapted to circular arc graphs we give a different proof to establish an upper bound of 9w(G) for online coloring a circular arc graph G with the First Fit a...

We consider the problem of construction of graphs with given degree k and girth 5 and as few vertices as possible. We give a construction of a family of girth 5 graphs based on relative difference sets. This family contains the smallest known graph of degree 8 and girth 5 which was constructed by G. Royle, four of the known cages including the Hoffman-Singleton graph, some graphs constructed by...

This paper proposes a method for constructing rate-compatible low-density parity-check (LDPC) codes. The construction considers the problem of optimizing a family of rate-compatible degree distributions as well as the placement of bipartite graph edges. A hybrid approach that combines information shortening and parity puncturing is proposed. Local graph conditioning techniques for the suppressi...

Lacking indoor navigation graph has become a bottleneck in applications and services. This paper presents novel automated reconstruction approach from large-scale low-frequency trajectories without any other data sources. The proposed includes three steps: trajectory simplification, 2D floor plan extraction 3D construction. First, we propose ST-Join-Clustering algorithm to identify simplify red...

Call graphs have many applications in software engineering, including bug-finding, security analysis, and code navigation IDEs. However, the construction of call requires significant investment program analysis infrastructure. An increasing number programming languages compile to Java Virtual Machine (JVM), frameworks such as WALA SOOT support a broad range algorithms by analyzing JVM bytecode....

In this paper, we present the information graph (IG) formalism, which provides a precise account of interplay between deductive and abductive inference causal evidential information, where ‘deduction’ is used for defeasible ‘forward’ inference. IGs formalise analyses performed by domain experts in informal reasoning tools they are familiar with, such as mind maps crime analysis. Based on princi...