Independent Feedback Vertex Set for $$P_5$$P5-Free Graphs
Sign Up to like & getrecommendations! Published in 2018 at "Algorithmica"
DOI: 10.1007/s00453-018-0474-x
Abstract: The NP-complete problem Feedback Vertex Set is that of deciding whether or not it is possible, for a given integer $$k\ge 0$$k≥0, to delete at most k vertices from a given graph so that what remains… read more here.
Keywords: vertex set; free graphs; independent feedback; feedback vertex ... See more keywords
Towards a Polynomial Kernel for Directed Feedback Vertex Set
Sign Up to like & getrecommendations! Published in 2021 at "Algorithmica"
DOI: 10.1007/s00453-020-00777-5
Abstract: In the Directed Feedback Vertex Set (DFVS) problem, the input is a directed graph D and an integer k. The objective is to determine whether there exists a set of at most k vertices intersecting… read more here.
Keywords: directed feedback; polynomial kernel; vertex set; towards polynomial ... See more keywords
Finding the fixed points of a Boolean network from a positive feedback vertex set
Sign Up to like & getrecommendations! Published in 2021 at "Bioinformatics"
DOI: 10.1093/bioinformatics/btaa922
Abstract: MOTIVATION In the modeling of biological systems by Boolean networks a key problem is finding the set of fixed points of a given network. Some constructed algorithms consider certain structural properties of the regulatory graph… read more here.
Keywords: fixed points; vertex set; network; feedback vertex ... See more keywords
Long-loop feedback vertex set and dismantling on bipartite factor graphs.
Sign Up to like & getrecommendations! Published in 2021 at "Physical review. E"
DOI: 10.1103/physreve.103.l061302
Abstract: Network dismantling aims at breaking a network into disconnected components and attacking vertices that intersect with many loops has proven to be a most efficient strategy. Yet existing loop-focusing methods do not distinguish the short… read more here.
Keywords: bipartite factor; long loop; loop feedback; vertex set ... See more keywords