101. |
102. Avoidable vertices and edges in graphsJesse Beisegel, Maria Chudnovsky, Vladimir Gurvich, Martin Milanič, Mary Agnes Milanič, 2019, objavljeni znanstveni prispevek na konferenci Ključne besede: simplicial vertex, avoidable vertex, avoidable edge, avoidable path, maximum weight clique problem, polynomial-time algorithm, hole-cyclically orientable graph Objavljeno v RUP: 20.08.2019; Ogledov: 2143; Prenosov: 156 Povezava na celotno besedilo |
103. |
104. |
105. Bipartite graphs of small readabilityRayan Chikhi, Vladan Jovičić, Stefan Kratsch, Paul Medvedev, Martin Milanič, Sofya Raskhodnikova, Nithin Varma, 2019, izvirni znanstveni članek Ključne besede: bipartite graph, readability, bipartite chain graph, polynomial-time algorithm, grid graph Objavljeno v RUP: 26.07.2019; Ogledov: 1677; Prenosov: 99 Povezava na celotno besedilo |
106. |
107. |
108. |
109. |
110. |