This HTML5 document contains 48 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n17http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216208%3A11320%2F11%3A10100314%21RIV12-MSM-11320___/
n20http://localhost/temp/predkladatel/
n11http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n5http://linked.opendata.cz/resource/domain/vavai/projekt/
n15http://linked.opendata.cz/resource/domain/vavai/subjekt/
n12http://linked.opendata.cz/ontology/domain/vavai/
n10http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/
skoshttp://www.w3.org/2004/02/skos/core#
rdfshttp://www.w3.org/2000/01/rdf-schema#
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n18http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n6http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n19http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n21http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n8http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216208%3A11320%2F11%3A10100314%21RIV12-MSM-11320___
rdf:type
n12:Vysledek skos:Concept
rdfs:seeAlso
http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/1531
dcterms:description
Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those vertices to which it was non-adjacent before, while keeping the rest of the graph unchanged. Two graphs are called switching-equivalent if one can be made isomorphic to the other by a sequence of switches. In this paper, we continue the study of computational complexity aspects of Seidel's switching, concentrating on Fixed Parameter Complexity. Among other results we show that switching to a graph with at most k edges, to a graph of maximum degree at most k, to a k-regular graph, or to a graph with minimum degree at least k are fixed parameter tractable problems, where k is the parameter. On the other hand, switching to a graph that contains a given fixed graph as an induced subgraph is W [1]-complete. We also show the NP-completeness of switching to a graph with a clique of linear size, and of switching to a graph with small number of edges. Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those vertices to which it was non-adjacent before, while keeping the rest of the graph unchanged. Two graphs are called switching-equivalent if one can be made isomorphic to the other by a sequence of switches. In this paper, we continue the study of computational complexity aspects of Seidel's switching, concentrating on Fixed Parameter Complexity. Among other results we show that switching to a graph with at most k edges, to a graph of maximum degree at most k, to a k-regular graph, or to a graph with minimum degree at least k are fixed parameter tractable problems, where k is the parameter. On the other hand, switching to a graph that contains a given fixed graph as an induced subgraph is W [1]-complete. We also show the NP-completeness of switching to a graph with a clique of linear size, and of switching to a graph with small number of edges.
dcterms:title
Parameterized Problems Related to Seidel''s Switching Parameterized Problems Related to Seidel''s Switching
skos:prefLabel
Parameterized Problems Related to Seidel''s Switching Parameterized Problems Related to Seidel''s Switching
skos:notation
RIV/00216208:11320/11:10100314!RIV12-MSM-11320___
n12:predkladatel
n15:orjk%3A11320
n4:aktivita
n13:Z n13:P
n4:aktivity
P(1M0545), Z(MSM0021620838), Z(MSM0021622419)
n4:cisloPeriodika
2
n4:dodaniDat
n8:2012
n4:domaciTvurceVysledku
n11:1039709 n11:1123580 n11:5997011
n4:druhVysledku
n16:J
n4:duvernostUdaju
n6:S
n4:entitaPredkladatele
n17:predkladatel
n4:idSjednocenehoVysledku
219534
n4:idVysledku
RIV/00216208:11320/11:10100314
n4:jazykVysledku
n19:eng
n4:klicovaSlova
Parameterized Complexity; Computational Complexity; Seidel's Switching
n4:klicoveSlovo
n18:Seidel%27s%20Switching n18:Computational%20Complexity n18:Parameterized%20Complexity
n4:kodStatuVydavatele
FR - Francouzská republika
n4:kontrolniKodProRIV
[0EF339C46EA0]
n4:nazevZdroje
Discrete Mathematics and Theoretical Computer Science
n4:obor
n21:IN
n4:pocetDomacichTvurcuVysledku
3
n4:pocetTvurcuVysledku
4
n4:projekt
n5:1M0545
n4:rokUplatneniVysledku
n8:2011
n4:svazekPeriodika
13
n4:tvurceVysledku
Hliněný, Petr Kratochvíl, Jan Jelínková, Eva Suchý, Ondřej
n4:wos
000290721600002
n4:zamer
n10:MSM0021622419 n10:MSM0021620838
s:issn
1365-8050
s:numberOfPages
24
n20:organizacniJednotka
11320