Solving problems on graphs of high rank-width

DOI10.1007/s00453-017-0290-8zbMath1390.68342WikidataQ93047965 ScholiaQ93047965MaRDI QIDQ1709595

Stefan Szeider, Robert Ganian, Eduard Eiben

Publication date: 6 April 2018

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-017-0290-8

zbMATH Keywords

monadic second-order logic; fixed-parameter algorithms; parameterized complexity; rank-width

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C75: Structural characterization of families of graphs

03B25: Decidability of theories and sets of sentences

05C85: Graph algorithms (graph-theoretic aspects)