Andreas Grigorjew defends his PhD thesis on Algorithms and Graph Structures for ... - Helsinki.fi

Retrieved on: 2025-02-07 14:50:55

Tags for this article:

NP-complete problems

Graph theory

Heuristic

Directed acyclic graph

Graph coloring

Andreas Grigorjew

Click the tags to see associated articles and topics

Andreas Grigorjew defends his PhD thesis on Algorithms and Graph Structures for ... - Helsinki.fi. View article details on hiswai:

Summary

Andreas Grigorjew's thesis explores NP-complete problems related to network flows using graph theory. It examines the Minimum Flow Decomposition problem, relevant to bioinformatics, employing heuristics and directed acyclic graphs for practical solutions.

Article found on: www.helsinki.fi

View Original Article