Lupa

Search the repository Help

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

Options:
  Reset


1 - 10 / 13
First pagePrevious page12Next pageLast page
1.
On hereditary efficiently dominatable graphs
Martin Milanič, 2011, unpublished conference contribution

Found in: ključnih besedah
Summary of found: ...efficient domination, efficiently dominatable graph, polynomial time algorithm, ...
Keywords: perfect code, efficient domination, efficiently dominatable graph, polynomial time algorithm
Published: 15.10.2013; Views: 1411; Downloads: 39
URL Full text (0,00 KB)

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

Found in: ključnih besedah
Summary of found: ...maximal stable set, equistable graph, polynomial time algorithm, ...
Keywords: maximal stable set, equistable graph, polynomial time algorithm
Published: 15.10.2013; Views: 1243; Downloads: 61
URL Full text (0,00 KB)

3.
Spread of influence in weighted networks under time and budget constraints
Ferdinando Cicalese, Martin Milanič, Ugo Vaccaro, Gennaro Cordasco, Luisa Gargano, Joseph Peters, 2015, original scientific article

Found in: ključnih besedah
Summary of found: ...viral marketing, dynamic monopolies, exact polynomial time algorithm, ...
Keywords: social networks, spread of influence, viral marketing, dynamic monopolies, exact polynomial time algorithm
Published: 15.10.2015; Views: 982; Downloads: 84
URL Full text (0,00 KB)

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

Found in: ključnih besedah
Summary of found: ...vector connectivity, APX-hardness, NP-hardness, polynomial-time algorithm, block graphs, ...
Keywords: vector connectivity, APX-hardness, NP-hardness, polynomial-time algorithm, block graphs
Published: 03.04.2017; Views: 618; Downloads: 21
URL Full text (0,00 KB)

5.
The maximum independent set problem and equistable graphs
Edin Husić, 201, master's thesis

Found in: ključnih besedah
Summary of found: ...independent set, polynomial algorithm, equistable graph...
Keywords: independent set, polynomial algorithm, equistable graph
Published: 09.11.2017; Views: 454; Downloads: 18
URL Full text (0,00 KB)
This document has more files! More...

6.
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

Found in: ključnih besedah
Summary of found: ...bipartite graph, readability, bipartite chain graph, polynomial-time algorithm, grid graph...
Keywords: bipartite graph, readability, bipartite chain graph, polynomial-time algorithm, grid graph
Published: 17.09.2018; Views: 358; Downloads: 20
URL Full text (0,00 KB)

7.
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

Found in: ključnih besedah
Summary of found: ...k-domination, total k-domination, proper interval graph, polynomial-time algorithm...
Keywords: k-domination, total k-domination, proper interval graph, polynomial-time algorithm
Published: 17.09.2018; Views: 300; Downloads: 74
URL Full text (0,00 KB)

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

Found in: ključnih besedah
Summary of found: ...bounded degree vertices, k-Bounded Weighted Efficient Domination, polynomial-time algorithm, graph algorithms...
Keywords: weighted efficient domination, bounded degree vertices, k-Bounded Weighted Efficient Domination, polynomial-time algorithm, graph algorithms
Published: 21.01.2019; Views: 243; Downloads: 89
URL Full text (0,00 KB)

9.
New algorithms for weighted k-domination and total k-domination problems in proper interval graphs
Nina Chiarelli, Tatiana Romina Hartinger, Valeria Alejandra Leoni, Marina Inés Lopez Pujato, Martin Milanič, 2019, original scientific article

Found in: ključnih besedah
Summary of found: ...k-domination, total k-domination, proper interval graph, polynomial-time algorithm...
Keywords: k-domination, total k-domination, proper interval graph, polynomial-time algorithm
Published: 18.07.2019; Views: 143; Downloads: 85
URL Full text (0,00 KB)

10.
Bipartite graphs of small readability
Rayan Chikhi, Vladan Jovičić, Stefan Kratsch, Paul Medvedev, Martin Milanič, Sofya Raskhodnikova, Nithin Varma, 2019, original scientific article

Found in: ključnih besedah
Summary of found: ...bipartite graph, readability, bipartite chain graph, polynomial-time algorithm, grid graph...
Keywords: bipartite graph, readability, bipartite chain graph, polynomial-time algorithm, grid graph
Published: 26.07.2019; Views: 150; Downloads: 24
URL Full text (0,00 KB)

Search done in 0 sec.
Back to top
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica