On the parameterized vertex cover problem for graphs with perfect matching

Abstract

A parameterized multilevel pattern matching architecture on FPGAs for network intrusion detection and prevention Science in China Series F-Information Sciences 52, 949 (2009); Graphs with vertex rainbow connection number two

Probability weighting effect in vertex cover of networks via prospect-theoretic learning

“…That is, players with a high rational degree will help to obtain wonderful cover results of a network. Future work will focus on vertex cover of networks under the framing effect of the prospect theory [39], [40].…”

A fixed-parameter algorithm for the maximum agreement forest problem on multifurcating trees

“…The techniques in this theory have been applied successfully in solving a large number of NP-hard problems [13][14][15][16][17][18]. In this paper, we will focus on the parameterized version of the MAF problem of two unrooted phylogenetic trees, which is formally defined as follows:…”

On Unknown Small Subsets and Implicit Measures: New Techniques for Parameterized Algorithms

“…For the vc-pm* problem, iterative compression technique has been used [43] to develop parameterized algorithms, which results in a special problem on König graph (a graph G is called a König graph if the number of edges in a maximum matching of G equals the size of a minimum vertex cover of G), as follows.…”

“…An M -alternating walk is called a U -walk in G (with respect to M ) if its both ends are in U and its last edge is in M . The main idea of the algorithm in [43] solving the vc-kpm* problem is based on the following lemma.…”

“…Therefore, the search tree produced by the above branching algorithm has at most 4 k leaves, which results in an O * (4 k )-time algorithm for the vc-kpm* problem. Combined with the iterative compression process, a parameterized algorithm with running time O * (9 k ) can be obtained for the vc-pm* problem [43] , which improves the previous best result O * (15 k ) [42] .…”