Results 1 
1 of
1
MyhillNerode methods for hypergraphs
 IN PROC. OF ISAAC 2013, LNCS
, 2013
"... We introduce a method of applying MyhillNerode methods from formal language theory to hypergraphs and show how this method can be used to obtain the following parameterized complexity results. – Hypergraph Cutwidth (deciding whether a hypergraph on n vertices has cutwidth at most k) is lineartime ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
(Show Context)
We introduce a method of applying MyhillNerode methods from formal language theory to hypergraphs and show how this method can be used to obtain the following parameterized complexity results. – Hypergraph Cutwidth (deciding whether a hypergraph on n vertices has cutwidth at most k) is lineartime solvable for constant k. – For hypergraphs of constant incidence treewidth (treewidth of the incidence graph), Hypertree Width and variants cannot be solved by simple finite tree automata. The proof leads us to conjecture that Hypertree Width is W[1]hard for this parameter.