Iskalni niz:
išči po
išči po
išči po
išči po
Vrsta gradiva:
Jezik:
Št. zadetkov: 4
Improved algorithms for k-domination and total k-domination in proper interval graphs
Nina Chiarelli, Tatiana Romina Hartinger, Valeria Alejandra Leoni, Marina Inés Lopez Pujato, Martin Milanič
Objavljeni znanstveni prispevek na konferenci
Oznake: k-dominacija;popolna k-dominacija;pravi intervalni graf;polinomski algoritem;k-domination;total k-domination;proper interval graph;polynomial-time algorithm;
Improved algorithms for k-domination and total k-domination in proper interval graphs
Leto: 2018 Vir: Univerza na Primorskem (UP)
New algorithms for weighted k-domination and total k-domination problems in proper interval graphs
Nina Chiarelli, Tatiana Romina Hartinger, Valeria Alejandra Leoni, Marina Inés Lopez Pujato, Martin Milanič
Izvirni znanstveni članek
Oznake: k-dominacija;popolna k-dominacija;pravi intervalni graf;polinomski algoritem;k-domination;total k-domination;proper interval graph;polynomial-time algorithm;
New algorithms for weighted k-domination and total k-domination problems in proper interval graphs
Leto: 2019 Vir: Univerza na Primorskem (UP)
On {k}-Roman graphs
Kenny Bešter Štorgel, Nina Chiarelli, Lara Fernández, J. Pascal Gollin, Claire Hilaire, Valeria Alejandra Leoni, Martin Milanič
Objavljeni znanstveni prispevek na konferenci
Oznake: graph domination;{k}-Roman domination;{k}-Roman graph;split graph;split join;NP-completeness;
For a positive integer k, a {k}-Roman dominating function of a graph G = (V, E) is a function f : V → {0, 1, . . . , k} satisfying f (N(v)) ≥ k for each vertex v ∈ V with f (v) = 0. Every graph G satisfies γ{Rk}(G) ≤ kγ(G), where γ{Rk}(G) denotes the minimum weight of a {k}-Roman dominating function ...
Leto: 2025 Vir: Fakulteta za matematiko, naravoslovje in informacijske tehnologije Koper (UP FAMNIT)
On the proper interval completion problem within some chordal subclasses
François Dross, Claire Hilaire, Ivo Koch, Valeria Alejandra Leoni, Nina Pardal, María Inés Lopez Pujato, Vinicius Fernandes dos Santos
Izvirni znanstveni članek
Oznake: proper interval completion;split graph;threshold graph;quasi-threshold graph;caterpillar;
Given a property (graph class) Π, a graph G, and an integer k, the Π-completion problem consists of deciding whether we can turn G into a graph with the property Π by adding at most k edges to G. The Π-completion problem is known to be NP-hard for general graphs when Π is the property of being a pro ...
Leto: 2025 Vir: Fakulteta za matematiko, naravoslovje in informacijske tehnologije Koper (UP FAMNIT)
Št. zadetkov: 4
Ključne besede:
Leto izdaje:
Avtorji:
Repozitorij:
Tipologija:
Jezik: