An Algorithm to Solve the Partition into Perfect Matchings Problem in Halin Graphs

  • Authors:

  • Yunting Lu;Dingjun Lou

  • Affiliations:

  • Department of Computer Science, Sun Yat-sen University, Guangzhou 510275, P.R. China;Department of Computer Science, Sun Yat-sen University, Guangzhou 510275, P.R. China

  • Venue:
  • ICCS '07 Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we consider whether the vertices of graph G can be partitioned into K subsets V 1, V 2, ... V K so that for each i 驴 {1,...,K}, the subgraph induced by V i is a perfect matching where K ≤ 驴 V 驴. It is known that it is an NP complete problem in general graphs. In this paper, we restrict the problem in Halin graphs and give an algorithm to find the minimum value of K (2 ≤ K ≤ 4) in Halin graphs. The time complexity is O(n).