Iskalni niz:
išči po
išči po
išči po
išči po
Vrsta gradiva:
Jezik:
Št. zadetkov: 15
Treewidth versus clique number. I. graph classes with a forbidden structure
Clément Jean Dallard, Martin Milanič, Kenny Štorgel
Izvirni znanstveni članek
Oznake: graph class;treewidth;clique number;
Leto: 2021 Vir: Repozitorij Univerze na Primorskem (RUP)
Classes of graphs with tree-independence number at most two
Mirza Redžić, Martin Milanič, Clément Jean Dallard
Magistrsko delo
Oznake: tree decomposition;treewidth;tree-independence number;induced minor;H-free graph;series parallel graph;
Leto: 2022 Vir: Fakulteta za matematiko, naravoslovje in informacijske tehnologije Koper (UP FAMNIT)
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)
Induced minor models
Anthony Perez, Nicolas Trotignon, Nicolas Bousquet, Clément Jean Dallard, Maël Dumas, Claire Hilaire, Martin Milanič
Izvirni znanstveni članek
Oznake: induced minor;treewidth;chromatic number;tree-independence number;Truemper configuration;
A graph H is an induced minor of G if there exists an induced minor model of H in G, that is, a collection of pairwise disjoint subsets of vertices of G labeled by the vertices of H, each inducing a connected subgraph in G, such that two vertices of H are adjacent if and only if there is an edge in ...
Leto: 2026 Vir: Fakulteta za matematiko, naravoslovje in informacijske tehnologije Koper (UP FAMNIT)
Bonsma, Paul; Paulusma, Daniël: Using contracted solution graphs for solving reconfiguration problems. (English summary) Acta Inform. 56 (2019), no. 7-8, 619-648.
Clément Dallard
Recenzija, prikaz knjige, kritika
Oznake: rekonfiguracija;dinamično programiranje;barvanje grafov;reconfiguration;dynamic programming;graph coloring;
Leto: 2021 Vir: Univerza na Primorskem (UP)
Towards a complexity dichotomy for colourful components problems on k-caterpillars and small-degree planar graphs
Janka Chlebíková, Clément Dallard
Objavljeni znanstveni prispevek na konferenci
Oznake: colorful component;caterpillar;binary tree;planar subcubic graph;
Towards a complexity dichotomy for colourful components problems on k-caterpillars and small-degree planar graphs
Leto: 2019 Vir: Univerza na Primorskem (UP)
Colourful components in k-caterpillars and planar graphs
Janka Chlebíková, Clément Dallard
Izvirni znanstveni članek
Oznake: barvita komponenta;gosenica;dvojiško drevo;ravninski subkubičen graf;colorful component;caterpillar;binary tree;planar subcubic graph;
Leto: 2021 Vir: Univerza na Primorskem (UP)
Vertex cover at distance on H-free graphs
Clément Dallard, Mirza Krbezlija, Martin Milanič
Objavljeni znanstveni prispevek na konferenci
Oznake: k-razdaljno točkovno pokritje;H-prost graf;NP-polnost;polinomski algoritem;dihotomija;distance-k vertex cover;H-free graph;np-completeness;polynomial-time algorithm;dichotomy;
Leto: 2021 Vir: Univerza na Primorskem (UP)
ǂA ǂcomplexitystudy of distance variants of covering and domination problems in H-free graphs
Mirza Krbezlija, Martin Milanič, Clément Dallard
Magistrsko delo
Oznake: distance-k dominating set;distance-k edge dominating set;distance-k vertex cover;distance k-edge cover;H-free graph;polynomial-time algorithm;NP-complete problem;dichotomy theorem;
Leto: 2021 Vir: Univerza na Primorskem (UP)
Treewidth versus clique number in graph classes with a forbidden structure
Clément Dallard, Martin Milanič, Kenny Štorgel
Objavljeni znanstveni prispevek na konferenci
Oznake: razred grafov;drevesna širina;klično število;graph class;treewidth;clique number;
Treewidth versus clique number in graph classes with a forbidden structure
Leto: 2020 Vir: Univerza na Primorskem (UP)
Št. zadetkov: 15
Ključne besede:
Leto izdaje:
Avtorji:
Repozitorij:
Tipologija:
Jezik: