"Some Parameterized Problems Related to Seidel's Switching"@en . . . "Some Parameterized Problems Related to Seidel's Switching" . "6"^^ . "Seidelovo p\u0159epnut\u00ED mno\u017Einy vrchol\u016F je operace, kter\u00E1 sma\u017Ee hrany vych\u00E1zejic\u00ED z t\u00E9to mno\u017Einy z grafu a p\u0159id\u00E1 do n\u011Bj ty hrany mezi mno\u017Einou a zbytkem grafu, kter\u00E9 tam p\u016Fvodn\u011B nebyly. Ostatn\u00ED hrany tato operace nem\u011Bn\u00ED. Obvykl\u00E1 ot\u00E1zka v parametrizovan\u00E9 slo\u017Eitosti je, zda exponenci\u00E1ln\u00ED \u010D\u00E1st algoritm\u016F pro t\u011B\u017Ek\u00E9 probl\u00E9my m\u016F\u017Ee b\u00FDt omezena n\u011Bjakou funkc\u00ED pouze zvolen\u00E9ho parametru, jen\u017E o\u010Dek\u00E1v\u00E1me, \u017Ee bude mal\u00FD. Studujeme slo\u017Eitost ot\u00E1zky, zda zadan\u00FD graf m\u016F\u017Ee b\u00FDt zm\u011Bn\u011Bn pomoc\u00ED Seidelova p\u0159epnut\u00ED na graf s n\u011Bjakou vlastnost\u00ED P z parametrizovan\u00E9ho hlediska. Ukazujeme parametrizovanou dostupnost p\u0159epnut\u00ED na regul\u00E1rn\u00ED graf, graf s omezen\u00FDm stupn\u011Bm vrchol\u016F, omezen\u00FDm po\u010Dtem hran a graf bez zak\u00E1zan\u00E9ho 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."@en . "11320" . "Matfyzpress" . "Parameterized; Problems; Related; Seidel's; Switching"@en . . "RIV/00216208:11320/07:00004897!RIV08-MSM-11320___" . "N\u011Bkter\u00E9 parametrizovan\u00E9 probl\u00E9my spojen\u00E9 se Seidelov\u00FDm p\u0159epnut\u00EDm"@cs . "23;28" . . "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." . "Such\u00FD, Ond\u0159ej" . "Some Parameterized Problems Related to Seidel's Switching" . . . "Some Parameterized Problems Related to Seidel's Switching"@en . "[F20E62D16075]" . "1"^^ . . . "WDS'07 Proceedings of Contributed Papers: Part I - Mathematics and Computer Sciences" . "Prague" . "Z(MSM0021620838)" . "451037" . . "Prague" . . . "978-80-7378-023-4" . "1"^^ . . "N\u011Bkter\u00E9 parametrizovan\u00E9 probl\u00E9my spojen\u00E9 se Seidelov\u00FDm p\u0159epnut\u00EDm"@cs . "2007-01-01+01:00"^^ . . . . . "RIV/00216208:11320/07:00004897" . .