master's thesis
Mirza Krbezlija (Author), Martin Milanič (Mentor), Clément Dallard (Co-mentor)

Abstract

No abstract data available

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;

Data

Language: English
Year of publishing:
Typology: 2.09 - Master's Thesis
Organization: UP - University of Primorska
Publisher: [M. Krbezlija]
UDC: 519.17(043.2)
COBISS: 81026563 Link will open in a new window
Views: 1592
Downloads: 18
Average score: 0 (0 votes)
Metadata: JSON JSON-RDF JSON-LD TURTLE N-TRIPLES XML RDFA MICRODATA DC-XML DC-RDF RDF

Other data

Secondary language: Slovenian
Secondary title: Študija zahtevnosti razdaljnih variant problemov pokritja in dominacije v H-prostih grafih
Secondary 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;
Type (COBISS): Master's thesis/paper
Thesis comment: Univ. na Primorskem, Fak. za matematiko, naravoslovje in informacijske tehnologije
Pages: VII, 65 str.
ID: 13525316