Related papers: Expander Decomposition for Non-Uniform Vertex Meas…
This short note modifies a reconstruction method by the author (Comm. PDE, 45(9):1118-1133, 2020), for reconstructing piecewise constant conductivities in the Calder\'on problem (electrical impedance tomography). In the former paper, a…
Previous work has suggested that the structural restrictions of graphs from classes of bounded expansion--locally dense pockets in a globally sparse graph--naturally coincide with common properties of real-world networks such as clustering…
In the Partially Embedded Planarity problem, we are given a graph $G$ together with a topological drawing of a subgraph $H$ of $G$. The task is to decide whether the drawing can be extended to a drawing of the whole graph such that no two…
A method for compression of large graphs and matrices to a block structure is further developed. Szemer\'edi's regularity lemma is used as a generic motivation of the significance of stochastic block models. Another ingredient of the method…
For a graph $G$, let $Z(G,\lambda)$ be the partition function of the monomer-dimer system defined by $\sum_k m_k(G)\lambda^k$, where $m_k(G)$ is the number of matchings of size $k$ in $G$. We consider graphs of bounded degree and develop a…
Let $F_k$ be the set of graphs on $k$ vertices. For a graph $G$, a $k$-decomposition is a set of induced subgraphs of $G$, each isomorphic to an element of $F_k$, such that each pair of vertices of $G$ is in exactly one element of the set.…
Testing graph cluster structure has been a central object of study in property testing since the foundational work of Goldreich and Ron [STOC'96] on expansion testing, i.e. the problem of distinguishing between a single cluster (an…
The Weisfeiler-Leman procedure is a widely-used technique for graph isomorphism testing that works by iteratively computing an isomorphism-invariant coloring of vertex tuples. Meanwhile, a fundamental tool in structural graph theory, which…
We study the directed global minimum vertex-cut problem: given a directed vertex-weighted graph $G$, compute a vertex-cut $(L,S,R)$ in $G$ of minimum value, which is defined to be the total weight of all vertices in $S$. The problem,…
Partitioning a graph into blocks of roughly equal weight while cutting only few edges is a fundamental problem in computer science with numerous practical applications. While shared-memory parallel partitioners have recently matured to…
Wavelet decompositions of integral operators have proven their efficiency in reducing computing times for many problems, ranging from the simulation of waves or fluids to the resolution of inverse problems in imaging. Unfortunately,…
A graph spanner is a fundamental graph structure that faithfully preserves the pairwise distances in the input graph up to a small multiplicative stretch. The common objective in the computation of spanners is to achieve the best-known…
Conventional spectral digraph partitioning methods typically symmetrize the adjacency matrix, thereby transforming the directed graph partitioning problem into an undirected one, where bipartitioning is commonly linked to minimizing graph…
We present faster algorithms for approximate maximum flow in undirected graphs with good separator structures, such as bounded genus, minor free, and geometric graphs. Given such a graph with $n$ vertices, $m$ edges along with a recursive…
In this paper we describe the thickened strips and the outside nested decompositions of any skew shape $\lambda/\mu$. For any such decomposition $\Phi=(\Theta_1,\Theta_2,\ldots,\Theta_g)$ of the skew shape $\lambda/\mu$ where $\Theta_i$ is…
For a fixed graph class $\Pi$, the goal of $\Pi$-Modification is to transform an input graph $G$ into a graph $H\in\Pi$ using at most $k$ modifications. Vertex and edge deletions are common operations, and their (parameterized) complexity…
We present the first sublinear-time algorithm for a distributed message-passing network sto compute its edge connectivity $\lambda$ exactly in the CONGEST model, as long as there are no parallel edges. Our algorithm takes $\tilde…
Despite there being significant work on developing spectral, and metric embedding based approximation algorithms for hypergraph generalizations of conductance, little is known regarding the approximability of hypergraph partitioning…
This paper describes the adaptation of a well-scaling parallel algorithm for computing Morse-Smale segmentations based on path compression to a distributed computational setting. Additionally, we extend the algorithm to efficiently compute…
In many models for large-scale computation, decomposition of the problem is key to efficient algorithms. For distance-related graph problems, it is often crucial that such a decomposition results in clusters of small diameter, while the…