z-logo
open-access-imgOpen Access
An Algorithm for Minimum Feedback Edge Set Problem
Author(s) -
Sang-Un Lee
Publication year - 2015
Publication title -
han-guk keompyuteo jeongbo hakoe nonmunji/han'gug keompyuteo jeongbo haghoe nonmunji
Language(s) - English
Resource type - Journals
eISSN - 2383-9945
pISSN - 1598-849X
DOI - 10.9708/jksci.2015.20.3.107
Subject(s) - kruskal's algorithm , minimum spanning tree , spanning tree , reverse delete algorithm , prim's algorithm , mathematics , enhanced data rates for gsm evolution , distributed minimum spanning tree , time complexity , feedback arc set , minimum weight , algorithm , set (abstract data type) , connected dominating set , edge cover , cardinality (data modeling) , graph , combinatorics , computer science , line graph , artificial intelligence , programming language , voltage graph , data mining

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here