Decomposition Algorithm for Median Graph of Triangulation of a Bordered 2D Surface

TL;DR

This paper presents an algorithm to decompose median graphs of triangulated 2D surfaces, simplifying their structure and restoring triangulations, with improved efficiency for identifying quivers of finite mutation type.

Contribution

It introduces a novel decomposition algorithm that simplifies median graphs and restores triangulations, enhancing the detection of quivers of finite mutation type.

Findings

Effective reduction of node degrees in median graphs

Criterion for identifying median graphs with nodes of degree at most 3

More efficient algorithm for determining quivers of finite mutation type

Abstract

This paper develops an algorithm that identifies and decomposes a median graph of a triangulation of a 2-dimensional (2D) oriented bordered surface and in addition restores all corresponding triangulation whenever they exist. The algorithm is based on the consecutive simplification of the given graph by reducing degrees of its nodes. From the paper \cite{FST1}, it is known that such graphs can not have nodes of degrees above 8. Neighborhood of nodes of degrees 8,7,6,5, and 4 are consecutively simplified. Then, a criterion is provided to identify median graphs with nodes of degrees at most 3. As a byproduct, we produce an algorithm that is more effective than previous known to determine quivers of finite mutation type of size greater than 10.