Home > Search Results: Chejnovská, Anna
Search:
Search Tips :: Advanced Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 1 records found  Search took 0.01 seconds. 
Optimisation using graph searching on special graph classes
 Chejnovská, Anna ; Gavenčiak, Tomáš (advisor) ; Šámal, Robert (referee)
For a given graph we define the minimum path cover as a minimum cardinality set of vertex disjoint paths covering all the vertices of the graph. This problem is one of the usual generalization of the Hamiltonian path problem. In this thesis we based our work on a paper Corneil et al. (2013) presenting a certifying algorithm for the minimal path cover problem on cocomparability graphs (the complement of graph of strict partial order). We first introduce this algorithm an then we experimentally examine its robustness to five operations on edges and vertices of the graph. We also analyse the impact of these operation on the size of the minimal path cover theoretically. Powered by TCPDF (www.tcpdf.org)
Detailed record

Interested in being notified about new results for this query?
Subscribe to the RSS feed.
Digital Repository :: Search :: Submit :: Personalize :: Help
Powered by Invenio v1.1.2
Maintained by admin.invenio@techlib.cz
This site is also available in the following languages:
Česky  English