Solving Problems on Graphs of High Rank-Width

DOI10.1007/978-3-319-21840-3_26zbMath1392.68199arXiv1507.05463MaRDI QIDQ3449829

Stefan Szeider, Robert Ganian, Eduard Eiben

Publication date: 30 October 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1507.05463

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)