Maximizing edge-ratio is NP-complete

Noble, Steven and Hansen, P. and Mladenović, N. (2011) Maximizing edge-ratio is NP-complete. Discrete Applied Mathematics 159 (18), pp. 2276-2280. ISSN 0166-218X.

Full text not available from this repository.

Official URL: https://doi.org/10.1016/j.dam.2011.07.016

Abstract

Given a graph 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.

Metadata

Item Type:	Article
School:	Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences
Depositing User:	Administrator
Date Deposited:	06 Jan 2023 14:26
Last Modified:	09 Aug 2023 12:54
URI:	https://eprints.bbk.ac.uk/id/eprint/50374

Statistics

Archive Staff Only (login required)

Edit/View Item