Login
Lupa
First page / Search the repository

Search the repository Help

A- | A+ | Print
Query: search in
search in
search in
search in
* old and bologna study programme

Options:
  Reset


11 - 19 / 19
First pagePrevious page12Next pageLast page
11.
Linear separation of connected dominating sets in graphs
Nina 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: 2040; Downloads: 158
.pdf Full text (648,51 KB)

12.
A dichotomy for weighted efficient dominating sets with bounded degree vertices
Andreas Brandstädt, Martin Milanič, 2019, original scientific article

Keywords: weighted efficient domination, bounded degree vertices, k-Bounded Weighted Efficient Domination, polynomial-time algorithm, graph algorithms
Published in RUP: 21.01.2019; Views: 1769; Downloads: 282
URL Link to full text

13.
Improved algorithms for k-domination and total k-domination in proper interval graphs
Nina Chiarelli, Tatiana Romina Hartinger, Valeria Alejandra Leoni, Marina Inés Lopez Pujato, Martin Milanič, 2018, published scientific conference contribution

Keywords: k-domination, total k-domination, proper interval graph, polynomial-time algorithm
Published in RUP: 17.09.2018; Views: 2018; Downloads: 149
URL Link to full text

14.
Bipartite graphs of small readability
Rayan 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: 1949; Downloads: 67
URL Link to full text

15.
The maximum independent set problem and equistable graphs : magistrsko delo
Edin Husić, 201, master's thesis

Keywords: independent set, polynomial algorithm, equistable graph
Published in RUP: 09.11.2017; Views: 2136; Downloads: 84
URL Link to full text
This document has more files! More...

16.
On the complexity of the vector connectivity problem
Ferdinando Cicalese, Martin Milanič, Romeo Rizzi, 2015, original scientific article

Keywords: vector connectivity, APX-hardness, NP-hardness, polynomial-time algorithm, block graphs
Published in RUP: 03.04.2017; Views: 2416; Downloads: 59
URL Link to full text

17.
Spread of influence in weighted networks under time and budget constraints
Ferdinando 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: 2666; Downloads: 192
URL Link to full text

18.
On the recognition of k-equistable graphs
Vadim E. Levit, Martin Milanič, D. Tankus, 2012, published scientific conference contribution

Keywords: maximal stable set, equistable graph, polynomial time algorithm
Published in RUP: 15.10.2013; Views: 2827; Downloads: 129
URL Link to full text

19.
On hereditary efficiently dominatable graphs
Martin Milanič, 2011, unpublished conference contribution

Keywords: perfect code, efficient domination, efficiently dominatable graph, polynomial time algorithm
Published in RUP: 15.10.2013; Views: 3108; Downloads: 67
URL Link to full text
Search done in 0 sec.
Back to top
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica