| Autor: |
Courcelle, Bruno, Métivier, Yves |
| Přispěvatelé: |
Courcelle, Bruno, Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB) |
| Jazyk: |
angličtina |
| Rok vydání: |
2020 |
| Předmět: |
|
| Popis: |
We study unfoldings of directed graphs and coverings of undirected ones, so as to highlight the similarities between the two notions. We generalize them by attaching finite or infinite weights to edges. Complete unfoldings and universal coverings of finite weighted graphs are infinite trees that can have nodes of count-ably infinite degree because we allow infinite weights, and are, in some sense, regular. We extend to complete unfoldings theorems established by Leighton and Norris for coverings. |
| Databáze: |
OpenAIRE |
| Externí odkaz: |
|
