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


1 - 10 / 35
First pagePrevious page1234Next pageLast page
1.
A complexitystudy of distance variants of covering and domination problems in H-free graphs : master's thesis
Mirza Krbezlija, 2021, master's thesis

Keywords: distance-k dominating set, distance-k edge dominating set, distance-k vertex cover, distance k-edge cover, H-free graph, polynomial-time algorithm, NP-complete problem, dichotomy theorem
Published in RUP: 18.10.2021; Views: 1822; Downloads: 18
URL Link to full text

2.
Vertex cover at distance on H-free graphs
Clément Jean Dallard, Mirza Krbezlija, Martin Milanič, 2021, published scientific conference contribution

Keywords: distance-k vertex cover, H-free graph, np-completeness, polynomial-time algorithm, dichotomy
Published in RUP: 16.07.2021; Views: 1349; Downloads: 30
URL Link to full text

3.
Complexity and algorithms for constant diameter augmentation problems
Eun Jung Kim, Martin Milanič, Jérôme Monnot, Christophe Picouleau, 2021, original scientific article

Keywords: graph diameter, blocker problem, polynomial algorithm, NP-complete problem
Published in RUP: 04.06.2021; Views: 908; Downloads: 57
URL Link to full text
This document has more files! More...

4.
Strong cliques in diamond-free graphs
Nina Chiarelli, Berenice Martínez-Barona, Martin Milanič, Jérôme Monnot, Peter Muršič, 2020, original scientific article

Keywords: maximal clique, maximal stable set, diamond-free graph, strong clique, simplicial clique, strongly perfect graph, CIS graph, NP-hard problem, polynomial-time algorithm, Erdős-Hajnal property
Published in RUP: 17.12.2020; Views: 1256; Downloads: 38
URL Link to full text

5.
A lower bound for the discriminant of polynomials related to Chebyshev polynomials
Slobodan Filipovski, 2021, original scientific article

Keywords: discriminant, Moore graphs, Chebyshev polynomial
Published in RUP: 02.12.2020; Views: 1270; Downloads: 36
URL Link to full text

6.
Graph search algorithms and structure of graph search trees : master's thesis
Nevena Pivač, 2020, master's thesis

Keywords: graph search, search tree, polynomial-time algorithms, BFS, DFS
Published in RUP: 02.10.2020; Views: 1133; Downloads: 18
URL Link to full text

7.
Mind the independence gap
Tinaz Ekim, Didem Gozüpek, Ademir Hujdurović, Martin Milanič, 2020, original scientific article

Keywords: maximal independent set, independent dominating set, well-covered graph, hereditary independence gap, polynomial-time algorithm, NP-hard problem
Published in RUP: 19.05.2020; Views: 1606; Downloads: 57
URL Link to full text

8.
Polynomials of degree 4 over finite fields representing quadratic residues
Shao Fei Du, Klavdija Kutnar, Dragan Marušič, 2019, original scientific article

Keywords: finite field, polynomial, quadratic residues
Published in RUP: 11.02.2020; Views: 1366; Downloads: 74
.pdf Full text (317,71 KB)

9.
A polynomial-time algorithm for the independent set problem in {P_{10}, C_4, C_6}-free graphs
Edin Husić, Martin Milanič, 2019, published scientific conference contribution

Keywords: independent set, augmenting graph, polynomial-time algorithm
Published in RUP: 16.10.2019; Views: 1583; Downloads: 115
URL Link to full text

10.
Generalizations of simplicial vertices and a new polynomially solvable case of the maximum weight clique problem, National Research University Higher School of Economics, Faculty of Computer Science, Moscow, 21. 8. 19
Martin Milanič, 2019, invited lecture at foreign university

Keywords: simplicial vertex, avoidable vertex, maximum weight clique problem, polynomial-time algorithm, hole-cyclically orientable graph
Published in RUP: 03.09.2019; Views: 1711; Downloads: 16
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