1. Vertextransitive expansions of (1, 3)treesMarko Lovrečič Saražin, Dragan Marušič, 2010, published scientific conference contribution Abstract: A nonidentity automorphism of a graph is said to be semiregular if all of its orbits are of the same length. Given a graph ▫$X$▫ with a semiregular automorphism ▫$\gamma$▫, the quotient of ▫$X$▫ relative to ▫$\gamma$▫ is the multigraph ▫$X/\gamma$▫ whose vertices are the orbits of ▫$\gamma$▫ and two vertices are adjacent by an edge with multiplicity ▫$r$▫ if every vertex of one orbit is adjacent to ▫$r$▫ vertices of the other orbit. We say that ▫$X$▫ is an expansion of ▫$X/\gamma$▫. In [J.D. Horton, I.Z. Bouwer, Symmetric ▫$Y$▫graphs and ▫$H$▫graphs, J. Combin. Theory Ser. B 53 (1991) 114129], Hortonand Bouwer considered a restricted sort of expansions (which we will call :strong" in this paper) where every leaf of ▫$X/\gamma$▫ expands to a single cycle in ▫$X$▫. They determined all cubic arctransitive strong expansions of simple ▫$(1,3)$▫trees, that is, trees with all of their vertice shaving valency 1 or 3, thus extending the classical result of Frucht, Graver and Watkins (see [R. Frucht, J.E. Graver, M.E. Watkins, The groups of the generalized Petersen graphs, Proc. Cambridge Philos. Soc. 70 (1971) 211218]) about arctransitive strong expansions of ▫$K_2$▫ (also known as the generalized Petersen graphs). In this paper another step is taken further by considering the possible structure of cubic vertextransitive expansions of general ▫$(1,3)$▫multitrees (where vertices with double edges are also allowed); thus the restriction on every leaf to be expanded to a single cycle is dropped. Found in: ključnih besedah Summary of found: ...graph, tree, cubic, vertextransitive, arctransitive, expansion... Keywords: graph, tree, cubic, vertextransitive, arctransitive, expansion Published: 15.10.2013; Views: 2121; Downloads: 55 Full text (0,00 KB) 
2. Parse tree based machine translation for lessused languagesJernej Vičič, Andrej Brodnik, 2008, original scientific article Abstract: The article describes a method that enhances translation performance of language pairs with a less used source language and a widely used target language. We propose a method that enables the use of parse tree based statistical translation algorithms for language pairs with a less used source language and a widely used target language. Automatic part of speech (POS) tagging algorithms have become accurate to the extent of efficient use in many tasks. Most of these methods are quite easily implementable in most world languages. The method is divided in two parts; the first part constructs alignments between POS tags of source sentences and induced parse trees of target language. The second part searches through trained data and selects the best candidates for target sentences, the translations. The method was not fully implemented due to time constraints; the training part was implemented and incorporated into a functional translation system; the inclusion of a word alignment model into the translation part was not implemented. The empirical evaluation addressing the quality of trained data was carried out on a full implementation of the presented training algorithms and the results confirm the employability of the method. Found in: ključnih besedah Summary of found: Zadetek v naslovu Keywords: machine translation, parse tree Published: 15.10.2013; Views: 3113; Downloads: 30 Full text (0,00 KB) 
3. On distance integral graphsDragan Stevanović, Marko Milošević, Milan Pokorný, Pavel Híc, 2015, original scientific article Found in: ključnih besedah Summary of found: ...distance spectrum, distance integral graph, tree, complete split graph, ... Keywords: distance spectrum, distance integral graph, tree, complete split graph Published: 03.04.2017; Views: 929; Downloads: 101 Full text (0,00 KB) 
4. 
5. Limiting behavior of 3color excitable media on arbitrary graphsJanko Gravner, Hanbaek Lyu, David Sivakoff, 2018, original scientific article Found in: ključnih besedah Summary of found: ...excitable media, cellular automaton, tournament expansion, treeindexed random walk... Keywords: excitable media, cellular automaton, tournament expansion, treeindexed random walk Published: 21.01.2019; Views: 401; Downloads: 343 Full text (901,07 KB) This document has more files! More...

6. Recognizing graph search treesJesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaž Krnc, Nevena Mitrović, Robert Scheffler, Martin Strehler, 2019, original scientific article Found in: ključnih besedah Summary of found: ...search tree recognition, LBFS, LDFS, MNS, MCS... Keywords: search tree recognition, LBFS, LDFS, MNS, MCS Published: 16.10.2019; Views: 131; Downloads: 32 Full text (0,00 KB) 
7. Towards a complexity dichotomy for colourful components problems on kcaterpillars and smalldegree planar graphsJanka Chlebíková, Clément Dallard, 2019, published scientific conference contribution Found in: ključnih besedah Summary of found: ...colorful component, caterpillar, binary tree, planar subcubic graph... Keywords: colorful component, caterpillar, binary tree, planar subcubic graph Published: 11.02.2020; Views: 91; Downloads: 15 Full text (0,00 KB) 