Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/6309
Full metadata record
DC FieldValueLanguage
dc.contributor.authorNoble, SD-
dc.contributor.authorHansen, P-
dc.contributor.authorMladenović, N-
dc.date.accessioned2012-03-19T09:37:15Z-
dc.date.available2012-03-19T09:37:15Z-
dc.date.issued2011-
dc.identifier.citationDiscrete Applied Mathematics, 159(18): 2276 - 2280, Dec 2011en_US
dc.identifier.issn0166-218X-
dc.identifier.urihttp://www.sciencedirect.com/science/article/pii/S0166218X11002770en
dc.identifier.urihttp://bura.brunel.ac.uk/handle/2438/6309-
dc.descriptionThis is the post-print verison of the Article. The official published version can be accessed from the link below - Copyright @ 2011 Elsevieren_US
dc.description.abstractGiven a graph G and a bipartition of its vertices, the edge-ratio is the minimum for both classes so defined of their number of internal edges divided by their number of cut edges. We prove that maximizing edge-ratio is NP-complete.en_US
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.subjectGraph clusteringen_US
dc.subjectCommunity detectionen_US
dc.subjectEdge-ratioen_US
dc.subjectNP-completeen_US
dc.titleMaximizing edge-ratio is NP-completeen_US
dc.typeArticleen_US
dc.identifier.doihttp://dx.doi.org/10.1016/j.dam.2011.07.016-
pubs.organisational-data/Brunel-
pubs.organisational-data/Brunel/Brunel Active Staff-
pubs.organisational-data/Brunel/Brunel Active Staff/School of Info. Systems, Comp & Maths-
pubs.organisational-data/Brunel/Brunel Active Staff/School of Info. Systems, Comp & Maths/Maths-
Appears in Collections:Publications
Computer Science
Dept of Mathematics Research Papers
Mathematical Sciences

Files in This Item:
File Description SizeFormat 
modularitybura.pdf112.71 kBAdobe PDFView/Open


Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.