Related papers: Nonbipartite Dulmage-Mendelsohn Decomposition for …
We prove a general width duality theorem for combinatorial structures with well-defined notions of cohesion and separation. These might be graphs and matroids, but can be much more general or quite different. The theorem asserts a duality…
A pair of orthonormal bases is called mutually unbiased if all mutual overlaps between any element of one basis with an arbitrary element of the other basis coincide. In case the dimension, $d$, of the considered Hilbert space is a power of…
Graph matching is a fundamental tool in computer vision and pattern recognition. In this paper, we introduce an algorithm for graph matching based on the proximal operator, referred to as differentiable proximal graph matching (DPGM).…
We completely characterise the optimal solutions for the three-marginal optimal transport problem - introduced in [K. Bolbotowski, G. Bouchitt\'e, Kantorovich-Rubinstein duality theory for the Hessian, 2024, preprint], and whose relaxation…
We define a graph-based rate optimization problem and consider its computation, which provides a unified approach to the computation of various theoretical limits, including the (conditional) graph entropy, rate-distortion functions and…
In this paper, we consider the problem of computing an optimal matching in a bipartite graph where elements of one side of the bipartition specify preferences over the other side, and one or both sides can have capacities and…
A triangle-free (simple) 2-matching is an edge set that has at most $2$ edges incident to each vertex and contains no cycle of length $3$. For the problem of finding a maximum cardinality triangle-free 2-matching in a given graph, a…
The notion of augmenting graphs generalizes Berge's idea of augmenting chains, which was used by Edmonds in his celebrated solution of the maximum matching problem. This problem is a special case of the more general maximum independent set…
Analyzing interconnection structures among underlying entities or objects in a dataset through the use of graph analytics has been shown to provide tremendous value in many application domains. However, graphs are not the primary…
In this paper, we prove that the self-dual morphological hierarchical structure computed on a n-D gray-level wellcomposed image u by the algorithm of G{\'e}raud et al. [1] is exactly the mathematical structure defined to be the tree of…
Symmetric tensor decomposition is an important problem with applications in several areas for example signal processing, statistics, data analysis and computational neuroscience. It is equivalent to Waring's problem for homogeneous…
In matching theory, barrier sets (also known as Tutte sets) have been studied extensively due to its connection to maximum matchings in a graph. In this paper, we first define $\theta$-barrier sets. Our definition of a $\theta$-barrier set…
The notion of duality -- that a given physical system can have two different mathematical descriptions -- is a key idea in modern theoretical physics. Establishing a duality in lattice statistical mechanics models requires the construction…
Unsupervised attributed graph representation learning is challenging since both structural and feature information are required to be represented in the latent space. Existing methods concentrate on learning latent representation via…
We describe two constructions of (very) dense graphs which are edge disjoint unions of large {\em induced} matchings. The first construction exhibits graphs on $N$ vertices with ${N \choose 2}-o(N^2)$ edges, which can be decomposed into…
We reduce the problem of finding an augmenting path in a general graph to a reachability problem in a directed bipartite graph. A slight modification of depth-first search leads to an algorithm for finding such paths. Although this setting…
Dominating sets and resolving sets have important applications in control theory and computer science. In this paper, we introduce an edge-analog of the classical dominant metric dimension of graphs. By combining the concepts of a…
Recently, the concept of frames generated by graphs has been introduced in \cite{D}. In this paper, we study spectrally optimal dual frames of frames generated by graphs. We show that if the frame is generated by a connected graph, then its…
In a sequence of four papers, we prove the following results (via a unified approach) for all sufficiently large $n$: (i) [1-factorization conjecture] Suppose that $n$ is even and $D \geq 2\lceil n/4\rceil -1$. Then every $D$-regular graph…
In the area of beyond-planar graphs, i.e. graphs that can be drawn with some local restrictions on the edge crossings, the recognition problem is prominent next to the density question for the different graph classes. For 1-planar graphs,…