| 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 (Co-mentor) |
|---|
| 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: | 1854 |
|---|
| Downloads: | 18 |
|---|
| Metadata: |     |
|---|
|
:
|
Copy citation |
|---|
| | | | Average score: | (0 votes) |
|---|
| Your score: | Voting is allowed only for logged in users. |
|---|
| Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
