Attributes | Values |
---|
rdf:type
| |
Description
| - Ukazujeme, že pro každé číslo k je otázka existence (sigma,ro)-dominující množiny v daném k=degenerovaném grafu buď polynomiální nebo NP-úplná, a podáváme úplnou charakterizaci těchto případů pro konečné množiny sigma a ro. (cs)
- We show that for every k, the problem of existence of a (sigma,rho)-dominating set performs a complete dichotomy when restricted to k-degenerate graphs, and we fully characterize the polynomial and NP-complete instances. It is further shown that the problem is polynomial time solvable if sigma, rho are such that every k-degenerate graph contains at most one (sigma, rho)-dominating set, and NP-complete otherwise. This relates to the concept of ambivalent graphs previously introduced for chordal graphs.
- We show that for every k, the problem of existence of a (sigma,rho)-dominating set performs a complete dichotomy when restricted to k-degenerate graphs, and we fully characterize the polynomial and NP-complete instances. It is further shown that the problem is polynomial time solvable if sigma, rho are such that every k-degenerate graph contains at most one (sigma, rho)-dominating set, and NP-complete otherwise. This relates to the concept of ambivalent graphs previously introduced for chordal graphs. (en)
|
Title
| - Generalized domination in degenerate graphs: A complete dichotomy of computational complexity
- Generalized domination in degenerate graphs: A complete dichotomy of computational complexity (en)
- Zobecněná dominace v degenerovaných grafech: Úplná dichotomie výpočetní složitosti (cs)
|
skos:prefLabel
| - Generalized domination in degenerate graphs: A complete dichotomy of computational complexity
- Generalized domination in degenerate graphs: A complete dichotomy of computational complexity (en)
- Zobecněná dominace v degenerovaných grafech: Úplná dichotomie výpočetní složitosti (cs)
|
skos:notation
| - RIV/00216208:11320/08:00100095!RIV09-MSM-11320___
|
http://linked.open...avai/riv/aktivita
| |
http://linked.open...avai/riv/aktivity
| - P(1M0545), Z(MSM0021620838)
|
http://linked.open...vai/riv/dodaniDat
| |
http://linked.open...aciTvurceVysledku
| |
http://linked.open.../riv/druhVysledku
| |
http://linked.open...iv/duvernostUdaju
| |
http://linked.open...titaPredkladatele
| |
http://linked.open...dnocenehoVysledku
| |
http://linked.open...ai/riv/idVysledku
| - RIV/00216208:11320/08:00100095
|
http://linked.open...riv/jazykVysledku
| |
http://linked.open.../riv/klicovaSlova
| - Generalized; domination; degenerate; graphs; complete; dichotomy; computational; complexity (en)
|
http://linked.open.../riv/klicoveSlovo
| |
http://linked.open...ontrolniKodProRIV
| |
http://linked.open...v/mistoKonaniAkce
| |
http://linked.open...i/riv/mistoVydani
| |
http://linked.open...i/riv/nazevZdroje
| - Theory and Applications of Models of Computation, Proceedings
|
http://linked.open...in/vavai/riv/obor
| |
http://linked.open...ichTvurcuVysledku
| |
http://linked.open...cetTvurcuVysledku
| |
http://linked.open...vavai/riv/projekt
| |
http://linked.open...UplatneniVysledku
| |
http://linked.open...iv/tvurceVysledku
| - Kratochvíl, Jan
- Golovach, Petr
|
http://linked.open...vavai/riv/typAkce
| |
http://linked.open...ain/vavai/riv/wos
| |
http://linked.open.../riv/zahajeniAkce
| |
http://linked.open...n/vavai/riv/zamer
| |
number of pages
| |
http://purl.org/ne...btex#hasPublisher
| |
https://schema.org/isbn
| |
http://localhost/t...ganizacniJednotka
| |
is http://linked.open...avai/riv/vysledek
of | |