11. Linear separation of connected dominating sets in graphsNina Chiarelli, Martin Milanič, 2019, original scientific article Keywords: connected dominating set, connected domination, connected-domishold graph, forbidden induced subgraph characterization, split graph, chordal graph, minimal cutset, minimal separator, 1-Sperner hypergraph, threshold hypergraph, threshold Boolean function, polynomial-time algorithm Published in RUP: 04.04.2019; Views: 2045; Downloads: 158 Full text (648,51 KB) |
12. |
13. |
14. Bipartite graphs of small readabilityRayan Chikhi, Vladan Jovičić, Stefan Kratsch, Paul Medvedev, Martin Milanič, Sofya Raskhodnikova, Nidhi Varma Srivastava, 2018, published scientific conference contribution Keywords: bipartite graph, readability, bipartite chain graph, polynomial-time algorithm, grid graph Published in RUP: 17.09.2018; Views: 1951; Downloads: 67 Link to full text |
15. |
16. |
17. Spread of influence in weighted networks under time and budget constraintsFerdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanič, Joseph Peters, Ugo Vaccaro, 2015, original scientific article Keywords: social networks, spread of influence, viral marketing, dynamic monopolies, exact polynomial time algorithm Published in RUP: 15.10.2015; Views: 2671; Downloads: 192 Link to full text |
18. |
19. |