Computing bond orders in molecule graphs
DOI10.1016/j.tcs.2010.12.063zbMath1211.68146OpenAlexW2017404539MaRDI QIDQ631782
Q. B. A. Bui, Sebastian Böcker, 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
tree decompositionNP-hardbioinformaticsfixed-parameter tractabilityFPTbond order assignmentMAX SNP-hard
Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Graph theory (including graph drawing) in computer science (68R10) Dynamic programming (90C39) Biochemistry, molecular biology (92C40) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Information storage and retrieval of data (68P20)
Cites Work
- Unnamed Item
- Unnamed Item
- Computational complexity of some restricted instances of 3-SAT
- Optimization, approximation, and complexity classes
- A partial k-arboretum of graphs with bounded treewidth
- Treewidth. Computations and approximations
- Proof verification and the hardness of approximation problems
- Graph minors. II. Algorithmic aspects of tree-width
- Complexity of Finding Embeddings in a k-Tree
This page was built for publication: Computing bond orders in molecule graphs