Text this: On the Complexity of Computing a Maximum Acyclic Matching in Undirected Graphs