Minimum Cycle Bases of Locally LEW-embedded Graphs

Xu Mei · College Mathematics · 2009

By Thomassen's work on large edge width embeddings,we obtain the definition of locally LEW-embedded graphs.Together with some basic knowledge of linear algebra,we prove that there exists a polynomial time algorithm for finding the minimum cycle bases of locally LEW-embedded graph.

Read the paper · More papers on PaperTik