Iskalni niz:
išči po
išči po
išči po
išči po
Vrsta gradiva:
Jezik:
Št. zadetkov: 1
Computing tree decompositions with small independence number
Clément Jean Dallard, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Martin Milanič
Izvirni znanstveni članek
Oznake: tree-independence number;approximation;parameterized algorithm;
The independence number of a tree decomposition is the maximum of the independence numbers of the subgraphs induced by its bags. The tree-independence number of a graph is the minimum independence number of a tree decomposition of it. Several NP-hard graph problems, like maximum-weight independent s ...
Leto: 2026 Vir: Fakulteta za matematiko, naravoslovje in informacijske tehnologije Koper (UP FAMNIT)
Št. zadetkov: 1
Ključne besede:
Leto izdaje:
Avtorji:
Repozitorij:
Tipologija:
Jezik: