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 / 17
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: ...perfect code, efficient domination, efficiently dominatable graph, polynomial time algorithm, ...
Keywords: perfect code, efficient domination, efficiently dominatable graph, polynomial time algorithm
Published: 15.10.2013; Views: 1441; Downloads: 42
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: 1280; Downloads: 65
URL Full text (0,00 KB)

3.
On the split structure of lifted groups
Aleksander Malnič, Rok Požar, 2016, original scientific article

Found in: ključnih besedah
Summary of found: ...algorithm, abelian cover, Cayley voltages, covering projection, graph, group extension, group presentation, lifting automorphisms, linear...
Keywords: algorithm, abelian cover, Cayley voltages, covering projection, graph, group extension, group presentation, lifting automorphisms, linear systems over the integers, semidirect product
Published: 15.10.2015; Views: 1048; Downloads: 61
URL Full text (0,00 KB)

4.
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: 483; Downloads: 18
URL Full text (0,00 KB)
This document has more files! More...

5.
On split liftings with sectional complements
Aleksander Malnič, Rok Požar, 2018, original scientific article

Found in: ključnih besedah
Summary of found: ...algorithm, Cayley voltages, covering projection, graph, group presentation, invariant section, lifting automorphisms, linear...
Keywords: algorithm, Cayley voltages, covering projection, graph, group presentation, invariant section, lifting automorphisms, linear systems over the integers, split extension
Published: 02.03.2018; Views: 590; Downloads: 96
URL Full text (0,00 KB)

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...
Keywords: bipartite graph, readability, bipartite chain graph, polynomial-time algorithm, grid graph
Published: 17.09.2018; Views: 401; Downloads: 27
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: 333; Downloads: 80
URL Full text (0,00 KB)

8.
Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, and a generalization of Dilworth's theorem
Martin Milanič, 2018, published scientific conference contribution abstract (invited lecture)

Found in: ključnih besedah
Summary of found: ...perfect phylogeny, NP-hard problem, graph coloring, branching, acyclic digraph, chain partition, Dilworth's... ...chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristic...
Keywords: perfect phylogeny, NP-hard problem, graph coloring, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristic
Published: 17.09.2018; Views: 288; Downloads: 5
URL Full text (0,00 KB)

9.
Aproksimacijski vidiki vektorske dominacije in vektorske povezanosti v grah
Mirza Krbezlija, 2018, undergraduate thesis

Found in: ključnih besedah
Summary of found: ... graph, vector domination, vector connectivity, submodular set covering... ...vector connectivity, submodular set covering problem, approximation algorithm, greedy heuristic, integer linear programming...
Keywords: graph, vector domination, vector connectivity, submodular set covering problem, approximation algorithm, greedy heuristic, integer linear programming
Published: 17.09.2018; Views: 348; Downloads: 11
URL Full text (0,00 KB)

10.
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: ...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: 261; Downloads: 96
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