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

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

2010-06-22

arxiv.org/abs/1006.4333v2

Mathematics

Combinatorics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Decomposition Algorithm for Median Graph of Triangulation of a Bordered 2D Surface does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Decomposition Algorithm for Median Graph of Triangulation of a Bordered 2D Surface, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decomposition Algorithm for Median Graph of Triangulation of a Bordered 2D Surface will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-108565