Iskalni niz:
išči po
išči po
išči po
išči po
Vrsta gradiva:
Jezik:
Št. zadetkov: 2
Exact algorithms for clustered planarity with linear saturators
Giordano Da Lozzo, Robert Ganian, Siddharth Gupta, Bojan Mohar, Sebastian Ordyniak, Meirav Zehavi
Objavljeni znanstveni prispevek na konferenci
Oznake: clustered planarity;independent c-graphs;path saturation;graph drawing;
We study Clustered Planarity with Linear Saturators, which is the problem of augmenting an ▫$n$▫-vertex planar graph whose vertices are partitioned into independent sets (called clusters) with paths - one for each cluster - that connect all the vertices in each cluster while maintaining planarity. W ...
Leto: 2024 Vir: Fakulteta za matematiko in fiziko (UL FMF)
Treewidth is NP-complete on cubic graphs
Hans L. Bodlaender, Édouard Bonnet, Lars Jaffke, Dušan Knop, Paloma T. Lima, Martin Milanič, Sebastian Ordyniak, Sukanya Pandey, Ondřej Suchý
Izvirni znanstveni članek
Oznake: treewidth;cubic graph;NP'completeness;
The concept of avoidable paths in graphs was introduced by Beisegel, Chudnovsky, Gurvich, Milanič, and Servatius in 2019 as a common generalization of avoidable vertices and simplicial paths. In 2020, Bonamy, Defrain, Hatzel, and Thiebaut proved that every graph containing an induced path of order k ...
Leto: 2025 Vir: Repozitorij Univerze na Primorskem (RUP)
Št. zadetkov: 2
Ključne besede:
Leto izdaje:
Avtorji:
Repozitorij:
Tipologija:
Jezik: