A relation-algebraic view on evolutionary algorithms for some graph problems

DOI10.1007/11730095_13MaRDI QIDQ1742609zbMATH OpenOpenAlexFDO

Authors Britta Kehden, F. Neumann

Publication date 12 April 2018

Full work available at URL https://doi.org/10.1007/11730095_13

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Relational Methods in Computer Science
• scientific article; zbMATH DE number 1342294
• scientific article; zbMATH DE number 1962832
• A novel evolutionary formulation of the maximum independent set problem
• Evolutionary algorithms and dynamic programming

Cited in

(5)

• Column-wise extendible vector expressions and the relational computation of sets of sets
• Evaluating Sets of Search Points Using Relational Algebra
• Relation-algebraic verification of Borůvka's minimum spanning tree algorithm
• Focused jump-and-repair constraint handling for fixed-parameter tractable graph problems closed under induced subgraphs
• Relational Methods in Computer Science

This page was built for publication: A relation-algebraic view on evolutionary algorithms for some graph problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1742609)