File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A simple algorithm for finding all k-edge-connected components

TitleA simple algorithm for finding all k-edge-connected components
Authors
Issue Date2015
PublisherPublic Library of Science. The Journal's web site is located at http://www.plosone.org/home.action
Citation
PLoS ONE, 2015, v. 10 n. 9, article no. e0136264 How to Cite?
Persistent Identifierhttp://hdl.handle.net/10722/217774
ISSN
2015 Impact Factor: 3.057
2015 SCImago Journal Rankings: 1.395
PubMed Central ID

 

DC FieldValueLanguage
dc.contributor.authorWang, T-
dc.contributor.authorZhang, Y-
dc.contributor.authorChin, FYL-
dc.contributor.authorTing, HF-
dc.contributor.authorTsin, YH-
dc.contributor.authorPoon, SH-
dc.date.accessioned2015-09-18T06:12:50Z-
dc.date.available2015-09-18T06:12:50Z-
dc.date.issued2015-
dc.identifier.citationPLoS ONE, 2015, v. 10 n. 9, article no. e0136264-
dc.identifier.issn1932-6203-
dc.identifier.urihttp://hdl.handle.net/10722/217774-
dc.languageeng-
dc.publisherPublic Library of Science. The Journal's web site is located at http://www.plosone.org/home.action-
dc.relation.ispartofPLoS ONE-
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.titleA simple algorithm for finding all k-edge-connected components-
dc.typeArticle-
dc.identifier.emailZhang, Y: yongzh@hku.hk-
dc.identifier.emailChin, FYL: chin@cs.hku.hk-
dc.identifier.emailTing, HF: hfting@cs.hku.hk-
dc.identifier.authorityChin, FYL=rp00105-
dc.identifier.authorityTing, HF=rp00177-
dc.description.naturepublished_or_final_version-
dc.identifier.doi10.1371/journal.pone.0136264-
dc.identifier.pmid26368134-
dc.identifier.pmcidPMC4569431-
dc.identifier.hkuros254903-
dc.identifier.volume10-
dc.identifier.issue9-
dc.publisher.placeUnited States-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats