Attributes | Values |
---|
rdf:type
| |
Description
| - We show that for chordal graphs, the problem of deciding the existence of a ($\sigma,\rho$)-dominating set performs a complete dichotomy: it is polynomial time solvable if $\sigma, \rho$ are such that every chordal graph contains at most one $(\sigma,\rho)$-dominating set, and NP-complete otherwise. The proof involves certain flavor of existentionality - we are not able to characterize such pairs $(\sigma,\rho)$ by a structural description, but at least we can provide a recursive algorithm for their recognition.
- We show that for chordal graphs, the problem of deciding the existence of a ($\sigma,\rho$)-dominating set performs a complete dichotomy: it is polynomial time solvable if $\sigma, \rho$ are such that every chordal graph contains at most one $(\sigma,\rho)$-dominating set, and NP-complete otherwise. The proof involves certain flavor of existentionality - we are not able to characterize such pairs $(\sigma,\rho)$ by a structural description, but at least we can provide a recursive algorithm for their recognition. (en)
|
Title
| - Computational complexity of generalized domination: A complete dichotomy for chordal graphs
- Computational complexity of generalized domination: A complete dichotomy for chordal graphs (en)
|
skos:prefLabel
| - Computational complexity of generalized domination: A complete dichotomy for chordal graphs
- Computational complexity of generalized domination: A complete dichotomy for chordal graphs (en)
|
skos:notation
| - RIV/00216208:11320/07:00206159!RIV10-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/07:00206159
|
http://linked.open...riv/jazykVysledku
| |
http://linked.open.../riv/klicovaSlova
| - Computational; complexity; generalized; domination; complete; dichotomy; chordal; graphs (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
| - Graph-theoretic Concepts in Computer Science
|
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 | |