Iskalni niz:
išči po
išči po
išči po
išči po
Vrsta gradiva:
Jezik:
Št. zadetkov: 3
Induced matching treewidth and tree-independence number, revisited
Noga Alon, Martin Milanič, Paweł Rzążewski
Izvirni znanstveni članek
Oznake: tree-independence number;induced matching treewidth;induced biclique;Kövári-Sós-Turán theorem;
We study two graph parameters defined via tree decompositions: tree-independence number and induced matching treewidth. Both parameters are defined similarly as treewidth, but with respect to different measures of a tree decomposition T of a graph G: for tree-independence number, the measure is the ...
Leto: 2026 Vir: Repozitorij Univerze na Primorskem (RUP)
Tree decompositions meet induced matchings
Paloma T. de Lima, Martin Milanič, Peter Muršič, Karolina Okrasa, Paweł Rzążewski, Kenny Štorgel
Izvirni znanstveni članek
Oznake: inducirana širina drevesa ujemanja;število neodvisnosti drevesa;množica vozlišč povratne zveze;inducirano pakiranje;algoritemski meta-izrek;induced matching treewidth;tree-independence number;feedback vertex set;induced packing;algorithmic meta-theorem;
Leto: 2026 Vir: Fakulteta za informacijske študije v Novem mestu (FIŠ)
Tree-independence number of ▫$P_5$▫-free graphs with no large bicliques
Václav Blažej, J. Pascal Gollin, Tomáš Hons, Tomáš Masařík, Martin Milanič, Paweł Rzążewski, Ondřej Suchý, Alexandra Wesolek
Objavljeni znanstveni prispevek na konferenci
Oznake: tree-independence number;independence degeneracy;independence treewidth;P5-free graphs;
The tree-independence number of a graph is the minimum, over all tree-decompositions of the graph, of the maximum size of an independent set contained in a bag. Graph classes of bounded tree-independence number have strong structural and algorithmic properties, but the parameter can be unbounded eve ...
Leto: 2026 Vir: Repozitorij Univerze na Primorskem (RUP)
Št. zadetkov: 3
Ključne besede:
Leto izdaje:
Avtorji:
Repozitorij:
Tipologija:
Jezik: