Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F14%3A10282647" target="_blank" >RIV/00216208:11320/14:10282647 - isvavai.cz</a>

Result on the web

<a href="http://dx.doi.org/10.1007/978-3-662-43948-7_41" target="_blank" >http://dx.doi.org/10.1007/978-3-662-43948-7_41</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-662-43948-7_41" target="_blank" >10.1007/978-3-662-43948-7_41</a>

Result language

angličtina

Original language name

Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs

Original language description

A graph G covers a graph H if there exists a locally bijective homomorphism from G to H. We deal with regular covers in which this locally bijective homomorphism is prescribed by an action of a subgroup of Aut(G). We apply the structural results used byBabai to study automorphism groups of graphs. Our main result is an FPT algorithm solving RegularCover for planar input G in asymptotic time exp(e(H)/2)) where e(H) denotes the number of the edges of H.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

BA - General mathematics

OECD FORD branch

—

Project

Result was created during the realization of more than one project. More information in the Projects tab.

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2014

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

Automata, Languages, and Programming

ISBN

978-3-662-43947-0

ISSN

—

e-ISSN

—

Number of pages

12

Pages from-to

489-501

Publisher name

Springer

Place of publication

Berlin

Event location

Copenhagen, Denmark

Event date

Jul 8, 2014

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—