相关论文: Simultaneous Feedback Edge Set: A Parameterized Pe…

In the Colored Clustering problem, one is asked to cluster edge-colored (hyper-)graphs whose colors represent interaction types. More specifically, the goal is to select as many edges as possible without choosing two edges that share an…

We study the Independent Feedback Vertex Set problem - a variant of the classic Feedback Vertex Set problem where, given a graph $G$ and an integer $k$, the problem is to decide whether there exists a vertex set $S\subseteq V(G)$ such that…

A signed graph is a graph where each edge receives a sign, positive or negative. The signed graph model has been used in many real applications, such as protein complex discovery and social network analysis. Finding cohesive subgraphs in…

Let ${\cal F}$ be a family of graphs. In the ${\cal F}$-Completion problem, we are given a graph $G$ and an integer $k$ as input, and asked whether at most $k$ edges can be added to $G$ so that the resulting graph does not contain a graph…

Given a graph $G=(V,E)$, a set $\mathcal{F}$ of forbidden subgraphs, we study $\mathcal{F}$-Free Edge Deletion, where the goal is to remove minimum number of edges such that the resulting graph does not contain any $F\in \mathcal{F}$ as a…

Given a graph on $n$ vertices and an integer $k$, the feedback vertex set problem asks for the deletion of at most $k$ vertices to make the graph acyclic. We show that a greedy branching algorithm, which always branches on an undecided…

In this paper, we present an algorithm for computing a feedback vertex set of a unit disk graph of size $k$, if it exists, which runs in time $2^{O(\sqrt{k})}(n+m)$, where $n$ and $m$ denote the numbers of vertices and edges, respectively.…

In this paper we show that the problem of identifying an edge $(i,j)$ in a graph $G$ such that there exists an optimal vertex cover $S$ of $G$ containing exactly one of the nodes $i$ and $j$ is NP-hard. Such an edge is called a weak edge.…

A monitoring edge-geodetic set of a graph is a subset $M$ of its vertices such that for every edge $e$ in the graph, deleting $e$ increases the distance between at least one pair of vertices in $M$. We study the following computational…

We study the following question: Given are two $k$-colorings $\alpha$ and $\beta$ of a graph $G$ on $n$ vertices, and integer $\ell$. The question is whether $\alpha$ can be modified into $\beta$, by recoloring vertices one at a time, while…

Given a graph $G$ and a positive integer $k$, the 2-Load coloring problem is to check whether there is a $2$-coloring $f:V(G) \rightarrow \{r,b\}$ of $G$ such that for every $i \in \{r,b\}$, there are at least $k$ edges with both end…

The cyclability of a graph is the maximum integer $k$ for which every $k$ vertices lie on a cycle. The algorithmic version of the problem, given a graph $G$ and a non-negative integer $k,$ decide whether the cyclability of $G$ is at least…

At IPEC 2020, Bergougnoux, Bonnet, Brettell, and Kwon showed that a number of problems related to the classic Feedback Vertex Set (FVS) problem do not admit a $2^{o(k \log k)} \cdot n^{\mathcal{O}(1)}$-time algorithm on graphs of treewidth…

We initiate the study of a new parameterization of graph problems. In a multiple interval representation of a graph, each vertex is associated to at least one interval of the real line, with an edge between two vertices if and only if an…

An induced subgraph is called an induced matching if each vertex is a degree-1 vertex in the subgraph. The \textsc{Almost Induced Matching} problem asks whether we can delete at most $k$ vertices from the input graph such that the remaining…

The semistrong edge coloring, as a relaxation of the well-known strong edge coloring, can be used to model efficient communication scheduling in wireless networks. An edge coloring of a graph $G$ is called \emph{semistrong} if every color…

We prove new complexity results for Feedback Vertex Set and Even Cycle Transversal on $H$-free graphs, that is, graphs that do not contain some fixed graph $H$ as an induced subgraph. In particular, we prove that for every $s\geq 1$, both…

We introduce a new notion of acyclicity representation in labeled graphs, and present three applications thereof. Our main result is an algorithm that, given a graph $G$ and a $k$-clique expression of $G$, in time $O(6^kn^c)$ counts modulo…

In this paper, we show how one may (efficiently) construct two types of extremal combinatorial objects whose existence was previously conjectural. (*) Panchromatic Graphs: For fixed integer k, a k-panchromatic graph is, roughly speaking, a…

Let $G$ be a graph of order $n$. For every $v\in V(G)$, let $E_G(v)$ denote the set of all edges incident with $v$. A signed $k$-submatching of $G$ is a function $f:E(G)\longrightarrow \{-1,1\}$, satisfying $f(E_G(v))\leq 1$ for at least…