1. On the end-vertex problem of graph searchesJesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaž Krnc, Nevena Pivač, Robert Scheffler, Martin Strehler, 2019, izvirni znanstveni članek Ključne besede: end-vertex, graph search, maximum cardinality search, maximal neighborhood search, graph classes
Objavljeno v RUP: 22.08.2019; Ogledov: 1938; Prenosov: 48
 Povezava na celotno besedilo |
2. Thermally modified (TM) beech wood : compression properties, fracture toughness and cohesive law in mode II obtained from the three-point end-notched flexure (3ENF) testVáclav Sebera, Miguel Redon, Martin Brabec, David Děcký, Petr Čermák, Jan Tippner, Jaromír Milch, 2019, izvirni znanstveni članek Ključne besede: beech, brittleness of wood, cohesive law, compliance-based beam method (CBBM), compressive elastic modulus, digital image correlation (DIC), equiva-lent crack length approach (ECLA), fracture, mode II, thermal modification, thermally modified wood (TMW), three-point end-notched flexure (3ENF)
Objavljeno v RUP: 17.07.2019; Ogledov: 2598; Prenosov: 117
Povezava na celotno besedilo |
3. |
4. Reachability relations in digraphsAleksander Malnič, Dragan Marušič, Norbert Seifter, Primož Šparl, Boris Zgrablić, 2008, izvirni znanstveni članek Opis: In this paper we study reachability relations on vertices of digraphs, informally defined as follows. First, the weight of a walk is equal to the number of edges traversed in the direction coinciding with their orientation, minus the number of edges traversed in the direction opposite to their orientation. Then, a vertex ▫$u$▫ is ▫$R_k^+$▫-related to a vertex ▫$v$▫ if there exists a 0-weighted walk from ▫$u$▫ to ▫$v$▫ whose every subwalk starting at u has weight in the interval ▫$[0,k]$▫. Similarly, a vertex ▫$u$▫ is ▫$R_k^-$▫-related to a vertex ▫$v$▫ if there exists a 0-weighted walk from ▫$u$▫ to ▫$v$▫ whose every subwalk starting at ▫$u$▫ has weight in the interval ▫$[-k,0]$▫. For all positive integers ▫$k$▫, the relations ▫$R_k^+$▫ and ▫$R_k^-$▫ are equivalence relations on the vertex set of a given digraph. We prove that, for transitive digraphs, properties of these relations are closely related to other properties such as having property ▫$\mathbb{Z}$▫, the number of ends, growth conditions, and vertex degree.
Ključne besede: graph theory, digraph, reachability relations, end of a graph, property ▫$\mathbb{Z}$▫, growth
Objavljeno v RUP: 02.04.2017; Ogledov: 3109; Prenosov: 136
Povezava na celotno besedilo |
5. The Opinions of GP's patients about suicide, assisted suicide, euthanasia, and suicide prevention : an Italian surveyS. Zanone Poma, Silvia Vicentini, Francesca Siviero, Antonello Grossi, Emanuele Toniolo, Vincenzo Baldo, Diego De Leo, 2015, izvirni znanstveni članek Ključne besede: opinions, end-of-life issues, survey, suicide, assisted suicide, euthanasia, Italy
Objavljeno v RUP: 14.10.2015; Ogledov: 3180; Prenosov: 134
Povezava na celotno besedilo |
6. eMIPS - A step closer to outsource the front end of innovation processKlemen Širok, Borut Likar, Katarina Košmrlj Muha, 2015, objavljeni povzetek znanstvenega prispevka na konferenci Ključne besede: inoviranje, problemi, učenje na daljavo, zunanje izvajanje dejavnosti, front end, innovation, problem, distance learning, eCoaching, outsourcing
Objavljeno v RUP: 13.10.2015; Ogledov: 3534; Prenosov: 73
Povezava na celotno besedilo |
7. |
