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 - 2 / 2
First pagePrevious page1Next pageLast page
1.
On hereditary efficiently dominatable graphs
Martin Milanič, 2011, published scientific conference contribution abstract

Found in: ključnih besedah
Summary of found: ...perfect code, efficient domination, efficiently dominatable graphs, polynomial time algorithms, hereditary graph classes, ...
Keywords: popolna koda, učinkovita dominacija, grafi z učinkovito dominantno množico, polinomski algoritmi, hereditarni grafovski razredi, perfect code, efficient domination, efficiently dominatable graphs, polynomial time algorithms, hereditary graph classes
Published: 15.10.2015; Views: 1300; Downloads: 95
URL Full text (0,00 KB)
This document has more files! More...

2.
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: 185; Downloads: 82
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