Zobrazeno 1 - 10
of 221
pro vyhledávání: '"Krithika R"'
An edge-colored graph is said to be balanced if it has an equal number of edges of each color. Given a graph $G$ whose edges are colored using two colors and a positive integer $k$, the objective in the Edge Balanced Connected Subgraph problem is to
Externí odkaz:
http://arxiv.org/abs/2403.06608
Autor:
Ardra, P. S., Babu, Jasine, Kashyap, Kritika, Krithika, R., Pallathumadam, Sreejith K., Rajendraprasad, Deepak
Color-constrained subgraph problems are those where we are given an edge-colored (directed or undirected) graph and the task is to find a specific type of subgraph, like a spanning tree, an arborescence, a single-source shortest path tree, a perfect
Externí odkaz:
http://arxiv.org/abs/2403.06580
The Path Contraction and Cycle Contraction problems take as input an undirected graph $G$ with $n$ vertices, $m$ edges and an integer $k$ and determine whether one can obtain a path or a cycle, respectively, by performing at most $k$ edge contraction
Externí odkaz:
http://arxiv.org/abs/2403.06290
In this work, we initiate the complexity study of Biclique Contraction and Balanced Biclique Contraction. In these problems, given as input a graph G and an integer k, the objective is to determine whether one can contract at most k edges in G to obt
Externí odkaz:
http://arxiv.org/abs/2307.10607
For a positive integer $\ell \geq 3$, the $C_\ell$-Contractibility problem takes as input an undirected simple graph $G$ and determines whether $G$ can be transformed into a graph isomorphic to $C_\ell$ (the induced cycle on $\ell$ vertices) using on
Externí odkaz:
http://arxiv.org/abs/2206.07358
A class domination coloring (also called cd-Coloring or dominated coloring) of a graph is a proper coloring in which every color class is contained in the neighbourhood of some vertex. The minimum number of colors required for any cd-coloring of $G$,
Externí odkaz:
http://arxiv.org/abs/2203.09106
Publikováno v:
In Journal of Computer and System Sciences August 2024 143
We show that for each non-negative integer k, every bipartite tournament either contains k arc-disjoint cycles or has a feedback arc set of size at most 7(k - 1).
Externí odkaz:
http://arxiv.org/abs/2002.06912
Publikováno v:
In Theoretical Computer Science 18 April 2023 954
Given a directed graph $D$ on $n$ vertices and a positive integer $k$, the Arc-Disjoint Cycle Packing problem is to determine whether $D$ has $k$ arc-disjoint cycles. This problem is known to be W[1]-hard in general directed graphs. In this paper, we
Externí odkaz:
http://arxiv.org/abs/1802.07090