File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: An efficient algorithm for finding maximum cycle packings in reducible flow graphs

TitleAn efficient algorithm for finding maximum cycle packings in reducible flow graphs
Authors
Chen, XZang, W
KeywordsAlgorithm
Complexity
Cycle packing
Feedback set
Network flow
Issue Date2004
PublisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/
Citation
Lecture Notes In Computer Science (Including Subseries Lecture Notes In Artificial Intelligence And Lecture Notes In Bioinformatics), 2004, v. 3341, p. 306-317 How to Cite?
DOI: http://dx.doi.org/10.1007/978-3-540-30551-4_28
AbstractReducible flow graphs occur naturally in connection with flow-charts of computer programs and are used extensively for code optimization and global data flow analysis. In this paper we present an O(n2m log (n 2/m)) algorithm for finding a maximum cycle packing in any weighted reducible flow graph with n vertices and m arcs. © Springer-Verlag 2004.
Persistent Identifierhttp://hdl.handle.net/10722/48600
ISSN
0302-9743
2020 SCImago Journal Rankings: 0.249
References
References in Scopus

 

DC FieldValueLanguage
dc.contributor.authorChen, Xen_HK
dc.contributor.authorZang, Wen_HK
dc.date.accessioned2008-05-22T04:18:34Z-
dc.date.available2008-05-22T04:18:34Z-
dc.date.issued2004en_HK
dc.identifier.citationLecture Notes In Computer Science (Including Subseries Lecture Notes In Artificial Intelligence And Lecture Notes In Bioinformatics), 2004, v. 3341, p. 306-317en_HK
dc.identifier.issn0302-9743en_HK
dc.identifier.urihttp://hdl.handle.net/10722/48600-
dc.description.abstractReducible flow graphs occur naturally in connection with flow-charts of computer programs and are used extensively for code optimization and global data flow analysis. In this paper we present an O(n2m log (n 2/m)) algorithm for finding a maximum cycle packing in any weighted reducible flow graph with n vertices and m arcs. © Springer-Verlag 2004.en_HK
dc.format.extent211827 bytes-
dc.format.extent1729 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypetext/plain-
dc.languageengen_HK
dc.publisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/en_HK
dc.relation.ispartofLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)en_HK
dc.rightsThe original publication is available at www.springerlink.comen_HK
dc.subjectAlgorithmen_HK
dc.subjectComplexityen_HK
dc.subjectCycle packingen_HK
dc.subjectFeedback seten_HK
dc.subjectNetwork flowen_HK
dc.titleAn efficient algorithm for finding maximum cycle packings in reducible flow graphsen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0178-4617&volume=44&issue=3&spage=195&epage=211&date=2006&atitle=An+Efficient+Algorithm+for+Finding+Maximum+Cycle+Packings+in+Reducible+Flow+Graphsen_HK
dc.identifier.emailZang, W:wzang@maths.hku.hken_HK
dc.identifier.authorityZang, W=rp00839en_HK
dc.description.naturepostprinten_HK
dc.identifier.doi10.1007/978-3-540-30551-4_28-
dc.identifier.scopuseid_2-s2.0-35048889511en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-35048889511&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume3341en_HK
dc.identifier.spage306en_HK
dc.identifier.epage317en_HK
dc.publisher.placeGermanyen_HK
dc.identifier.scopusauthoridChen, X=8987182300en_HK
dc.identifier.scopusauthoridZang, W=7005740804en_HK
dc.identifier.issnl0302-9743-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats