Iskalni niz:
išči po
išči po
išči po
išči po
Vrsta gradiva:
Jezik:
Št. zadetkov: 13
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)
Proportionally dense subgraph of maximum size
Cristina Bazgan, Janka Chlebíková, Clément Dallard, Thomas Pontoizeau
Izvirni znanstveni članek
Oznake: dense subgraph;approximation;complexity;hamiltonian cubic graphs;
Proportionally dense subgraph of maximum size
Leto: 2019 Vir: Univerza na Primorskem (UP)
Scaffolding problems revisited
Mathias Weller, Annie Chateau, Clément Dallard, Rodolphe Giroudeau
Izvirni znanstveni članek
Oznake: complexity;approximation;lower bound;kernel;scaffolding;{ISK4,wheel}-free graph;
Scaffolding problems revisited
Leto: 2018 Vir: Univerza na Primorskem (UP)
On girth and the parameterized complexity of token sliding and token jumping
Valentin Bartier, Nicolas Bousquet, Clément Dallard, Kyle Lomer, Amer E. Mouawad
Izvirni znanstveni članek
Oznake: kombinatorična rekonfiguracija;neodvisna množica;skakanje žetonov;drsanje žetonov;parametrizirana kompleksnost;combinatorial reconfiguration;independent set;token jumping;token sliding;parameterized complexity;
Leto: 2021 Vir: Univerza na Primorskem (UP)
On girth and the parameterized complexity of token sliding and token jumping
Valentin Bartier, Nicolas Bousquet, Clément Dallard, Kyle Lomer, Amer E. Mouawad
Objavljeni znanstveni prispevek na konferenci
Oznake: combinatorial reconfiguration;independent set;token jumping;token sliding;parameterized complexity;
Leto: 2020 Vir: Univerza na Primorskem (UP)
Št. zadetkov: 13
Ključne besede:
Leto izdaje:
Avtorji:
Repozitorij:
Tipologija:
Jezik: