Title: An Algorithm for Generating Directed Cutsets of Directed Cycling Graph Based on Edge Contracted
Abstract: In order to improve the efficiency of the algorithm for generating directed cutsets of directed cycling graph, directed cycling graph is converted to directed acyclic graph with contracted vertices by contracting edge of rings in directed cycling graph, and the algorithm for generating directed cutsets of directed acyclic graph is made to generate directed cutsets of directed cycling graph. Time complexity and space complexity of the proposed algorithm have been analyzed theoretically, and the experimental test has been made. The results of theoretical analysis and experiments show that the proposed algorithm is very efficient.
Publication Year: 2009
Publication Date: 2009-01-01
Language: en
Type: article
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot