A complexitystudy of distance variants of covering and domination problems in H-free graphs : master's thesis

SLO

First page / Show document

Show document

A- | A+ | Print

Title:	A complexitystudy of distance variants of covering and domination problems in H-free graphs : master's thesis
Authors:	ID Krbezlija, Mirza (Author) ID Milanič, Martin (Mentor) More about this mentor... ID Dallard, Clément Jean (Comentor)
Files:	https://www.famnit.upr.si/sl/studij/zakljucna_dela/view/1005
Language:	English
Work type:	Master's thesis/paper
Typology:	2.09 - Master's Thesis
Organization:	FAMNIT - Faculty of Mathematics, Science and Information Technologies
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
Place of publishing:	Koper
Place of performance:	Koper
Publisher:	[M. Krbezlija]
Year of publishing:	2021
Year of performance:	2021
Number of pages:	VII, 65 str.
PID:	20.500.12556/RUP-17025
UDC:	519.17(043.2)
COBISS.SI-ID:	81026563
Publication date in RUP:	18.10.2021
Views:	3143
Downloads:	21
Metadata:
:	KRBEZLIJA, Mirza, 2021, A complexitystudy of distance variants of covering and domination problems in H-free graphs : master’s thesis [online]. Master’s thesis. Koper : M. Krbezlija. [Accessed 5 April 2025]. Retrieved from: https://www.famnit.upr.si/sl/studij/zakljucna_dela/view/1005 Copy citation

Average score:	0.5 1 1.5 2 2.5 3 3.5 4 4.5 5 (0 votes)
Your score:	Voting is allowed only for logged in users.
Share:

Similar works from our repository:

Similar works from other repositories:

Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Language:	English
Title:	Študija zahtevnosti razdaljnih variant problemov pokritja in dominacije v H-prostih grafih : magistrsko delo
Keywords:	k-razdaljna dominantna množica, k-razdaljna povezavno dominantna množica, k-razdaljno točkovno pokritje, k-razdaljno povezavno pokritje, H-prost graf, polinomski algoritem, NP-poln problem, dihotomija

Leave comment

You must log in to leave a comment.

Comments (0)

0 - 0 / 0

There are no comments!

Back