Computing bond orders in molecule graphs

DOI10.1016/j.tcs.2010.12.063zbMath1211.68146MaRDI QIDQ631782

Sebastian Böcker, Q. B. A. Bui, Anke Truss

Publication date: 14 March 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.12.063

zbMATH Keywords

tree decomposition; NP-hard; bioinformatics; fixed-parameter tractability; FPT; bond order assignment; MAX SNP-hard

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68P15: Database theory

68R10: Graph theory (including graph drawing) in computer science

90C39: Dynamic programming

92C40: Biochemistry, molecular biology

92E10: Molecular structure (graph-theoretic methods, methods of differential topology, etc.)

68P20: Information storage and retrieval of data