Lupa

Search the repository Help

A- | A+ | Print
Query: search in
search in
search in
search in
* old and bologna study programme

Options:
  Reset


1 - 10 / 50
First pagePrevious page12345Next pageLast page
1.
2.
Testing whether the lifted group splits
Rok Požar, 2016, original scientific article

Abstract: Let a group of automorphisms lift along a regular covering projection of connected graphs given combinatorially by means of voltages. The data that determine the lifted group and its action are then conveniently encoded in terms of voltages as well. Along these lines, an algorithm for testing whether the lifted group is a split extension of the group of covering transformations has recently been proposed in the case when the group of covering transformations is solvable. It consists of decomposing the covering into a series of coverings with elementary abelian groups of covering transformations, and inductively solving the problem at every elementary abelian step. Although the explicit construction of the lifted group is not needed, it still involves time and space consuming constructions of certain subgroups in the lifted group at every step except at the final one. In this paper, an improved version that completely avoids such constructions is presented. From voltage distribution we first compute the weak action and the factor set that determine the lifted group, and we then carry out the test by extracting the necessary information only from the corresponding weak actions and factor sets at every step. An experimental comparison is made against the previous version.
Keywords: algorithm, graph, group extension, lifting automorphisms, regular covering projection, voltages
Published in RUP: 03.01.2022; Views: 873; Downloads: 17
.pdf Full text (317,95 KB)

3.
4.
5.
Transformacija Burrows-Wheelerja : zaključna naloga
Doroteja Vujinović, 2021, undergraduate thesis

Keywords: Burrows-Wheeler Transform, BWT, text, pattern matching, suffix, algorithm
Published in RUP: 18.10.2021; Views: 1013; Downloads: 9
URL Link to full text

6.
Fast recognition of some parametric graph families
Nina Klobas, Matjaž Krnc, 2021, published scientific conference contribution

Keywords: I-graphs, double generalized Petersen graphs, folded cubes, recognition algorithm, cycle regularity
Published in RUP: 18.10.2021; Views: 1242; Downloads: 23
URL Link to full text

7.
Vertex cover at distance on H-free graphs
Clément Jean Dallard, Mirza Krbezlija, Martin Milanič, 2021, published scientific conference contribution

Keywords: distance-k vertex cover, H-free graph, np-completeness, polynomial-time algorithm, dichotomy
Published in RUP: 16.07.2021; Views: 1544; Downloads: 30
URL Link to full text

8.
9.
10.
Search done in 0 sec.
Back to top
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica