Comparing universal covers in polynomial time

Abstract

We show that universal covers of finite graphs can be compared in polynomial time

Keywords

• universal covers
• computational complexity