SLO

Login

First page / Search the repository

Search the repository

A- | A+ | Print

Query:	search in
	search in
	search in
	search in
Work type:	* old and bologna study programme
Language:
Search in:
Options:	Show only hits with full text
	Reset

1 - 2 / 2

1

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: 4644; Downloads: 26
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: 4118; Downloads: 38
Link to full text

Search done in 0 sec.

Logos of partners