Iskanje po repozitoriju

A dichotomy for weighted efficient dominating sets with bounded degree vertices
Andreas Brandstädt, Martin Milanič, 2019, izvirni znanstveni članek

Ključne besede: weighted efficient domination, bounded degree vertices, k-Bounded Weighted Efficient Domination, polynomial-time algorithm, graph algorithms
Objavljeno v RUP: 21.01.2019; Ogledov: 1772; Prenosov: 282
Povezava na celotno besedilo

Bipartite graphs of small readability
Rayan Chikhi, Vladan Jovičić, Stefan Kratsch, Paul Medvedev, Martin Milanič, Sofya Raskhodnikova, Nidhi Varma Srivastava, 2018, objavljeni znanstveni prispevek na konferenci

Ključne besede: bipartite graph, readability, bipartite chain graph, polynomial-time algorithm, grid graph
Objavljeno v RUP: 17.09.2018; Ogledov: 1955; Prenosov: 67
Povezava na celotno besedilo

Spread of influence in weighted networks under time and budget constraints
Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanič, Joseph Peters, Ugo Vaccaro, 2015, izvirni znanstveni članek

Ključne besede: social networks, spread of influence, viral marketing, dynamic monopolies, exact polynomial time algorithm
Objavljeno v RUP: 15.10.2015; Ogledov: 2672; Prenosov: 192
Povezava na celotno besedilo

On hereditary efficiently dominatable graphs
Martin Milanič, 2011, prispevek na konferenci brez natisa

Ključne besede: perfect code, efficient domination, efficiently dominatable graph, polynomial time algorithm
Objavljeno v RUP: 15.10.2013; Ogledov: 3120; Prenosov: 67
Povezava na celotno besedilo