This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

The maximum edge biclique problem is NP-complete

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Peeters, R. (Tilburg University, Faculty of Economics and Business Administration)
Abstract

We prove that the maximum edge biclique problem in bipartite graphs is NP-complete. A biclique in a bipartite graph is a vertex induced subgraph which is complete. The problem of finding a biclique with a maximum number of vertices is known to be solvable in polynomial time but the complexity of finding a biclique with a maximum number of edges was still undecided.

Download Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

File URL: http://arno.uvt.nl/show.cgi?fid=4081
File Format: application/pdf
File Function:
Download Restriction: no

Publisher Info
Paper provided by Tilburg University, Faculty of Economics and Business Administration in its series Research Memorandum with number 789.

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length:
Date of creation: 2000
Date of revision:
Handle: RePEc:dgr:kubrem:2000789

Contact details of provider:
Web page: http://cwis.uvt.nl/~few/few2/

For technical questions regarding this item, or to correct its listing, contact: (Corry Stuyts).

Related research
Keywords: bicliques;

This paper has been announced in the following NEP Reports:

Statistics
Access and download statistics

Did you know? IDEAS also indexes book chapters.

This page was last updated on 2009-12-6.

This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.