相关论文: $O(1)$ Steiner Point Removal in Series-Parallel Gr…

For fixed integers $r,\ell \geq 0$, a graph $G$ is called an {\em $(r,\ell)$-graph} if the vertex set $V(G)$ can be partitioned into $r$ independent sets and $\ell$ cliques. The class of $(r, \ell)$ graphs generalizes $r$-colourable graphs…

We introduce a decomposition method for the distributed calculation of exact Euclidean Minimum Spanning Trees in high dimensions (where sub-quadratic algorithms are not effective), or more generalized geometric-minimum spanning trees of…

In this paper, we consider the following graph partitioning problem: The input is an undirected graph $G=(V,E),$ a balance parameter $b \in (0,1/2]$ and a target conductance value $\gamma \in (0,1).$ The output is a cut which, if non-empty,…

We study the following problem: for given integers $d$, $k$ and graph $G$, can we reduce some fixed graph parameter $\pi$ of $G$ by at least $d$ via at most $k$ graph operations from some fixed set $S$? As parameters we take the chromatic…

A graph $G(V, E)$ is \emph{claw-free} if no vertex has three pairwise non-adjacent neighbours. The Maximum Weight Stable Set (MWSS) Problem in a claw-free graph is a natural generalization of the Matching Problem and has been shown to be…

We consider the Minimum Steiner Cut problem on undirected planar graphs with non-negative edge weights. This problem involves finding the minimum cut of the graph that separates a specified subset $X$ of vertices (terminals) into two parts.…

In the Split to Block Vertex Deletion and Split to Threshold Vertex Deletion problems the input is a split graph $G$ and an integer $k$, and the goal is to decide whether there is a set $S$ of at most $k$ vertices such that $G-S$ is a block…

This work introduces a highly scalable spectral graph densification framework for learning resistor networks with linear measurements, such as node voltages and currents. We prove that given $O(\log N)$ pairs of voltage and current…

In the Disjoint Paths problem, the input consists of an $n$-vertex graph $G$ and a collection of $k$ vertex pairs, $\{(s_i,t_i)\}_{i=1}^k$, and the objective is to determine whether there exists a collection $\{P_i\}_{i=1}^k$ of $k$…

The feedback vertex set problem is one of the most studied parameterized problems. Several generalizations of the problem have been studied where one is to delete vertices to obtain graphs close to acyclic. In this paper, we give an FPT…

We introduce a graph partitioning problem motivated by computational topology and propose two algorithms that produce approximate solutions. Specifically, given a weighted, undirected graph $G$ and a positive integer $k$, we desire to find…

Let $W(G)$ be the Wiener index of a graph $G$. We say that a vertex $v \in V(G)$ is a \v{S}olt\'es vertex in $G$ if $W(G - v) = W(G)$, i.e. the Wiener index does not change if the vertex $v$ is removed. In 1991, \v{S}olt\'es posed the…

In this paper, we study the parallel and the space complexity of the graph isomorphism problem (\GI{}) for several parameterizations. Let $\mathcal{H}=\{H_1,H_2,\cdots,H_l\}$ be a finite set of graphs where $|V(H_i)|\leq d$ for all $i$ and…

A split graph is a graph whose vertex set can be partitioned into a clique and a stable set. Given a graph $G$ and weight function $w: V(G) \to \mathbb{Q}_{\geq 0}$, the Split Vertex Deletion (SVD) problem asks to find a minimum weight set…

In this paper we study the problem of finding $(\epsilon, \phi)$-expander decompositions of a graph in the streaming model, in particular for dynamic streams of edge insertions and deletions. The goal is to partition the vertex set so that…

{\sc Vertex $(s, t)$-Cut} and {\sc Vertex Multiway Cut} are two fundamental graph separation problems in algorithmic graph theory. We study matroidal generalizations of these problems, where in addition to the usual input, we are given a…

A recent palette sparsification theorem of Assadi, Chen, and Khanna [SODA'19] states that in every $n$-vertex graph $G$ with maximum degree $\Delta$, sampling $O(\log{n})$ colors per each vertex independently from $\Delta+1$ colors almost…

$H$-Packing is the problem of finding a maximum number of vertex-disjoint copies of $H$ in a given graph $G$. $H$-Partition is the special case of finding a set of vertex-disjoint copies that cover each vertex of $G$ exactly once. Our goal…

The persistence diagram (PD) is an increasingly popular topological descriptor. By encoding the size and prominence of topological features at varying scales, the PD provides important geometric and topological information about a space.…

We develop a new framework for generalizing approximation algorithms from the structural graph algorithm literature so that they apply to graphs somewhat close to that class (a scenario we expect is common when working with real-world…