相关论文: Largest chordal and interval subgraphs faster than…

A graph with n vertices is 1-planar if it can be drawn in the plane such that each edge is crossed at most once, and is optimal if it has the maximum of 4n-8 edges. We show that optimal 1-planar graphs can be recognized in linear time. Our…

A cocomparability graph is a graph whose complement admits a transitive orientation. An interval graph is the intersection graph of a family of intervals on the real line. In this paper we investigate the relationships between interval and…

We introduce the class of interval $H$-graphs, which is the generalization of interval graphs, particularly interval bigraphs. For a fixed graph $H$ with vertices $a_1,a_2,\dots,a_k$, we say that an input graph $G$ with given partition…

In this paper, we focus on the class of complete $S$-partite graphs, for $S$ an undirected graph possibly with self-loops, and address the problem of finding largest $2$-regular subgraphs of these graphs, which can be formulated as an…

In the last decade, algorithmic frameworks based on a structural graph parameter called mim-width have been developed to solve generally NP-hard problems. However, it is known that the frameworks cannot be applied to the Clique problem, and…

We consider the problem of approximating the girth, $g$, of an unweighted and undirected graph $G=(V,E)$ with $n$ nodes and $m$ edges. A seminal result of Itai and Rodeh [SICOMP'78] gave an additive $1$-approximation in $O(n^2)$ time, and…

We first design an $\mathcal{O}(n^2)$ solution for finding a maximum induced matching in permutation graphs given their permutation models, based on a dynamic programming algorithm with the aid of the sweep line technique. With the support…

In a directed graph $G=(V,E)$ with a capacity on every edge, a \emph{bottleneck path} (or \emph{widest path}) between two vertices is a path maximizing the minimum capacity of edges in the path. For the single-source all-destination version…

Chung and Graham [J. London Math. Soc. 1983] claimed to prove that there exists an $n$-vertex graph $G$ with $ \frac{5}{2}n \log_2 n + O(n)$ edges that contains every $n$-vertex tree as a subgraph. Frati, Hoffmann and T\'oth [Combin.…

In the restricted shortest paths problem, we are given a graph $G$ whose edges are assigned two non-negative weights: lengths and delays, a source $s$, and a delay threshold $D$. The goal is to find, for each target $t$, the length of the…

In this paper, we consider the problem of finding a cycle of length $2k$ (a $C_{2k}$) in an undirected graph $G$ with $n$ nodes and $m$ edges for constant $k\ge2$. A classic result by Bondy and Simonovits [J.Comb.Th.'74] implies that if $m…

A bipartite graph $G=(U,V,E)$ is convex if the vertices in $V$ can be linearly ordered such that for each vertex $u\in U$, the neighbors of $u$ are consecutive in the ordering of $V$. An induced matching $H$ of $G$ is a matching such that…

In this paper we merge recent developments on exact algorithms for finding an ordering of vertices of a given graph that minimizes bandwidth (the BANDWIDTH problem) and for finding an embedding of a given graph into a line that minimizes…

In this note we prove that for every integer $k$, there exist constants $g_{1}(k)$ and $g_{2}(k)$ such that the following holds. If $G$ is a graph on $n$ vertices with maximum degree $\Delta$ then it contains an induced subgraph $H$ on at…

Connected Vertex Cover is one of the classical problems of computer science, already mentioned in the monograph of Garey and Johnson. Although the optimization and decision variants of finding connected vertex covers of minimum size or…

The intersection graph of a collection of trapezoids with corner points lying on two parallel lines is called a trapezoid graph. Using binary indexed tree data structure, we improve algorithms for calculating the size and the number of…

We improve the best known upper bound on the number of edges in a unit-distance graph on $n$ vertices for each $n\in\{16,\ldots,30\}$. When $n\leq 21$, our bounds match the best known lower bounds, and we fully enumerate the densest…

For many hard computational problems, simple algorithms that run in time $2^n \cdot n^{O(1)}$ arise, say, from enumerating all subsets of a size-$n$ set. Finding (exponentially) faster algorithms is a natural goal that has driven much of…

The problem of enumerating connected subgraphs of a given size in a graph has been extensively studied in recent years. In this paper, we propose an algorithm with a delay of $O(k\Delta)$ for enumerating all connected induced subgraphs of…

For a graph $G$, let $f_2(G)$ denote the largest number of vertices in a $2$-regular subgraph of $G$. We determine the minimum of $f_2(G)$ over $3$-regular $n$-vertex simple graphs $G$. To do this, we prove that every $3$-regular multigraph…