Algorithms and Computation
From MaRDI portal
Publication:5191643
DOI10.1007/b94771zbMath1205.68530OpenAlexW1769833081MaRDI QIDQ5191643
Ge Xia, Jian'er Chen, Iyad A. Kanj
Publication date: 7 August 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b94771
Analysis of algorithms (68W40) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (3)
An O *(1.0977 n ) Exact Algorithm for max independent set in Sparse Graphs ⋮ The compatibility of binary characters on phylogenetic networks: Complexity and parameterized algorithms ⋮ Pathwidth of cubic graphs and exact algorithms
This page was built for publication: Algorithms and Computation
