Related papers: Canonical Representations for Circular-Arc Graphs …
We show that if $p=O(1/n)$, then the Erd\H{o}s-R\'{e}nyi random graph $G(n,p)$ with high probability admits a canonical labeling computable in time $O(n\log n)$. Combined with the previous results on the canonization of random graphs, this…
Weak unit disk contact graphs are graphs that admit representing nodes as a collection of internally disjoint unit disks whose boundaries touch if there is an edge between the corresponding nodes. In this work we focus on graphs without…
Linear diagrams are used to visualize set systems by depicting set memberships as horizontal line segments in a matrix, where each set is represented as a row and each element as a column. Each such line segment of a set is shown in a…
We prove that the number of geometrically indecomposable representations of fixed dimension vector d of a canonical algebra C defined over a finite field Fq is given by a polynomial in q (depending on C and d). We prove a similar result for…
We propose a simple and efficient local algorithm for graph isomorphism which succeeds for a large class of sparse graphs. This algorithm produces a low-depth canonical labeling, which is a labeling of the vertices of the graph that…
We give canonical matrices of a pair (A,B) consisting of a nondegenerate form B and a linear operator A satisfying B(Ax,Ay)=B(x,y) on a vector space over F in the following cases: (i) F is an algebraically closed field of characteristic…
To date, the best circle graph recognition algorithm runs in almost linear time as it relies on a split decomposition algorithm that uses the union-find data-structure. We show that in the case of circle graphs, the PC-tree data-structure…
Results on matrix canonical forms are used to give a complete description of the higher rank numerical range of matrices arising from the study of quantum error correction. It is shown that the set can be obtained as the intersection of…
IC-planar graphs are those graphs that admit a drawing where no two crossed edges share an end-vertex and each edge is crossed at most once. They are a proper subfamily of the 1-planar graphs. Given an embedded IC-planar graph $G$ with $n$…
The minimum dominating set problem asks for a dominating set with minimum size. First, we determine some vertices contained in the minimum dominating set of a graph. By applying a particular scheme, we ensure that the resulting graph is…
Temporal graphs represent binary relationships that change along time. They can model the dynamism of, for example, social and communication networks. Temporal graphs are defined as sets of contacts that are edges tagged with the temporal…
In this article we show that there are branching systems (which induce representations of the graph algebra $C^*(E)$) associated to each row-countable graph $E$. For row-countable graphs, we characterize the condition $(L)$ via branching…
We give two algorithms computing representative families of linear and uniform matroids and demonstrate how to use representative families for designing single-exponential parameterized and exact exponential time algorithms. The…
Circular-arc graphs are intersection graphs of arcs on the circle. The aim of our work is to present a polynomial time algorithm testing whether two circular-arc graphs are isomorphic. To accomplish our task we construct decomposition…
This paper introduces Roundabout Constrained Convex Generators (RCGs), a set representation framework for modeling multiply connected regions in control and verification applications. The RCG representation extends the constrained convex…
This is a survey article for "Handbook of Linear Algebra", 2nd ed., Chapman & Hall/CRC, 2014. An informal introduction to representations of quivers and finite dimensional algebras from a linear algebraist's point of view is given. The…
We identify all minimal chordal graphs that are not circular-arc graphs, thereby resolving one of ``the main open problems'' concerning the structures of circular-arc graphs as posed by Dur{\'{a}}n, Grippo, and Safe in 2011. The problem had…
This paper is concerned with structures of general graphs with perfect matchings. We first reveal a partially ordered structure among factor-components of general graphs with perfect matchings. Our second result is a generalization of…
In this paper we address the problem of matching sets of vectors embedded in the same input space. We propose an approach which is motivated by canonical correlation analysis (CCA), a statistical technique which has proven successful in a…
The current paper is dedicated to the problem of finding the number of mutually non isomorphic bipartite graphs of the type $g=\langle R_g ,C_g ,E_g \rangle$ at given $n=|R_g |$ and $m=|C_g |$, where $R_g$ and $C_g$ are the two disjoint…