Computing bond orders in molecule graphs
DOI10.1016/j.tcs.2010.12.063zbMath1211.68146MaRDI 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 decomposition; NP-hard; bioinformatics; fixed-parameter tractability; FPT; bond order assignment; MAX SNP-hard
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
Cites Work
- 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
- Unnamed Item
- Unnamed Item