Feedback edge sets in temporal graphs
نویسندگان
چکیده
The classical, linear-time solvable Feedback Edge Set problem is concerned with finding a minimum number of edges intersecting all cycles in (static, unweighted) graph. We provide first study this the setting temporal graphs , where are present only at certain points time. find that there four natural generalizations which turn out to be NP-hard. also tractability these problems respect several parameters (solution size, lifetime, and graph vertices, among others) obtain some parameterized hardness but fixed-parameter results.
منابع مشابه
full edge-friendly index sets of complete bipartite graphs
let $g=(v,e)$ be a simple graph. an edge labeling $f:eto {0,1}$ induces a vertex labeling $f^+:vtoz_2$ defined by $f^+(v)equiv sumlimits_{uvin e} f(uv)pmod{2}$ for each $v in v$, where $z_2={0,1}$ is the additive group of order 2. for $iin{0,1}$, let $e_f(i)=|f^{-1}(i)|$ and $v_f(i)=|(f^+)^{-1}(i)|$. a labeling $f$ is called edge-friendly if $|e_f(1)-e_f(0)|le 1$. $i_f(g)=v_f(...
متن کاملOn edge-sets of bicliques in graphs
A biclique is a maximal induced complete bipartite subgraph of a graph. We investigate the intersection structure of edge-sets of bicliques in a graph. Specifically, we study the associated edge-biclique hypergraph whose hyperedges are precisely the edge-sets of all bicliques. We characterize graphs whose edgebiclique hypergraph is conformal (i.e., it is the clique hypergraph of its 2-section) ...
متن کاملEulerian edge sets in locally finite graphs
In a finite graph, an edge set Z is an element of the cycle space if and only if every vertex has even degree in Z. We extend this basic result to the topological cycle space, which allows infinite circuits, of locally finite graphs. In order to do so, it becomes necessary to attribute a parity to the ends of the graph.
متن کاملIndependent sets in edge-clique graphs
We show that the edge-clique graphs of cocktail party graphs have unbounded rankwidth. This, and other observations lead us to conjecture that the edge-clique cover problem is NP-complete for cographs. We show that the independent set problem on edge-clique graphs of cographs and of distance-hereditary graphs can be solved in O(n4) time. We show that the independent set problem on edge-clique g...
متن کاملIndependent sets in edge-clique graphs II
We show that edge-clique graphs of cocktail party graphs have unbounded rankwidth. This, and other observations lead us to conjecture that the edge-clique cover problem is NP-complete for cographs. We show that the independent set problem on edge-clique graphs of cographs and of distance-hereditary graphs can be solved in polynomial time. We show that the independent set problem on edge-clique ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2022
ISSN: ['1872-6771', '0166-218X']
DOI: https://doi.org/10.1016/j.dam.2021.09.029