Skip to main content

1 Result(s)

within Computer Science Remove this filter Algorithm Analysis and Problem Complexity Remove this filter Algorithms Remove this filter **-Fan Wang Remove this filter Chapter Remove this filter Conference Paper Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Parameterized and Approximation Algorithms for Finding Two Disjoint Matchings

    We first present a fixed-parameter algorithm for the NP-hard problem of deciding if there are two matchings M1 and M2 in a given graph G such that |M1| + |M2| is no less than a given number k. The algorithm runs ...

    Zhi-Zhong Chen, Ying Fan, Lusheng Wang in Combinatorial Optimization and Applications (2013)