An Exact Algorithm for finding Maximum Induced Matching in Subcubic Graphs

Authors Gordon Hoi, Ammar Fathin Sabili, Frank Stephan

Publication date 10 January 2022

Graph theory (including graph drawing) in computer science (68R10)

Abstract: The Maximum Induced Matching problem asks to find the maximum

k

such that, given a graph

G = (V, E)

, can we find a subset of vertices

S

of size

k

for which every vertices

v

in the induced graph

G [S]

has exactly degree

1

. In this paper, we design an exact algorithm running in

O (1.263 0^{n})

time and polynomial space to solve the Maximum Induced Matching problem for graphs where each vertex has degree at most 3. Prior work solved the problem by finding the Maximum Independent Set using polynomial space in the line graph

L (G^{2})

; this method uses

O (1.313 9^{n})

time.

This page was built for publication: An Exact Algorithm for finding Maximum Induced Matching in Subcubic Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6387852)