Iskalni niz:
išči po
išči po
išči po
išči po
Vrsta gradiva:
Jezik:
Št. zadetkov: 2
Objavljeni znanstveni prispevek na konferenci
Oznake: social contagion model;fire spread simulation;mixed integer linear programming;
Relying on a simplified model of fire spread, the Graph Burning Problem is an NP-hard combinatorial optimization problem that yields a metric of social contagion or vulnerability of a network. It concerns a discrete-time process on a simple undirected graph, with, in each timestep, a diffusion phase ...
Leto: 2026 Vir: Repozitorij Univerze v Novi Gorici (RUNG)
Izvirni znanstveni članek
Oznake: signed double Roman dominion;cubic graphs,;discharging method;generalized Petersen graphs;
The signed double Roman domination problem is a combinatorial optimization problem on a graph asking to assign a label from {±1,2,3} to each vertex feasibly, such that the total sum of assigned labels is minimized. Here feasibility is given whenever (i) vertices labeled ±1 have at least one neighbor ...
Leto: 2024 Vir: Repozitorij Univerze v Novi Gorici (RUNG)
Št. zadetkov: 2
Ključne besede:
Leto izdaje:
Avtorji:
Repozitorij:
Tipologija:
Jezik: