About: Some Parameterized Problems Related to Seidel's Switching     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • Seidelovo přepnutí množiny vrcholů je operace, která smaže hrany vycházejicí z této množiny z grafu a přidá do něj ty hrany mezi množinou a zbytkem grafu, které tam původně nebyly. Ostatní hrany tato operace nemění. Obvyklá otázka v parametrizované složitosti je, zda exponenciální část algoritmů pro těžké problémy může být omezena nějakou funkcí pouze zvoleného parametru, jenž očekáváme, že bude malý. Studujeme složitost otázky, zda zadaný graf může být změněn pomocí Seidelova přepnutí na graf s nějakou vlastností P z parametrizovaného hlediska. Ukazujeme parametrizovanou dostupnost přepnutí na regulární graf, graf s omezeným stupněm vrcholů, omezeným počtem hran a graf bez zakázaného podgrafu. (cs)
  • Seidel's switching of vertex set is an operation, which deletes edges leaving this set from the graph and adds those edges between the set and the rest of the graph, that weren't there originally. Other edges remain untouched by this operation. The usual question in parameterized complexity is whether the exponential part of the algorithms for hard problems can be bounded by some function of only selected parameter, which we assume to be small. We study the complexity of a question, if the given graph can be turned into a graph with some property P using Seidel's switching, from the parameterized view. We show fixed-parameter tractability of switching to a regular graph, to a graph with bounded degree of vertices, or with bounded number of edges and a graph without a forbidden subgraph.
  • Seidel's switching of vertex set is an operation, which deletes edges leaving this set from the graph and adds those edges between the set and the rest of the graph, that weren't there originally. Other edges remain untouched by this operation. The usual question in parameterized complexity is whether the exponential part of the algorithms for hard problems can be bounded by some function of only selected parameter, which we assume to be small. We study the complexity of a question, if the given graph can be turned into a graph with some property P using Seidel's switching, from the parameterized view. We show fixed-parameter tractability of switching to a regular graph, to a graph with bounded degree of vertices, or with bounded number of edges and a graph without a forbidden subgraph. (en)
Title
  • Some Parameterized Problems Related to Seidel's Switching
  • Some Parameterized Problems Related to Seidel's Switching (en)
  • Některé parametrizované problémy spojené se Seidelovým přepnutím (cs)
skos:prefLabel
  • Some Parameterized Problems Related to Seidel's Switching
  • Some Parameterized Problems Related to Seidel's Switching (en)
  • Některé parametrizované problémy spojené se Seidelovým přepnutím (cs)
skos:notation
  • RIV/00216208:11320/07:00004897!RIV08-MSM-11320___
http://linked.open.../vavai/riv/strany
  • 23;28
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • 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
  • 451037
http://linked.open...ai/riv/idVysledku
  • RIV/00216208:11320/07:00004897
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Parameterized; Problems; Related; Seidel's; Switching (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [F20E62D16075]
http://linked.open...v/mistoKonaniAkce
  • Prague
http://linked.open...i/riv/mistoVydani
  • Prague
http://linked.open...i/riv/nazevZdroje
  • WDS'07 Proceedings of Contributed Papers: Part I - Mathematics and Computer Sciences
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Suchý, Ondřej
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
http://linked.open...n/vavai/riv/zamer
number of pages
http://purl.org/ne...btex#hasPublisher
  • Matfyzpress
https://schema.org/isbn
  • 978-80-7378-023-4
http://localhost/t...ganizacniJednotka
  • 11320
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software