(Q60680123)

English

The maximum edge biclique problem is NP-complete

article by René Peeters published September 2003 in Discrete Applied Mathematics

In more languages

default values for all languages

No label defined

No description defined

edit

Statements

instance of

scholarly article

0 references

title

The maximum edge biclique problem is NP-complete (English)

0 references

1 reference

René Peeters

1

0 references

publication date

September 2003

0 references

published in

Discrete Applied Mathematics

0 references

volume

131

0 references

issue

3

0 references

page(s)

651-654

0 references

maintained by WikiProject

WikiProject Mathematics

0 references

cites work

On the Shannon capacity of a graph

1 reference

stated in

Crossref

reference URL

https://api.crossref.org/works/10.1016%2FS0166-218X%2803%2900333-0

retrieved

7 January 2021

based on heuristic

inferred from DOI database lookup

Node-and edge-deletion NP-complete problems

1 reference

stated in

Crossref

reference URL

https://api.crossref.org/works/10.1016%2FS0166-218X%2803%2900333-0

retrieved

7 January 2021

based on heuristic

inferred from DOI database lookup

Identifiers

DOI

10.1016/S0166-218X(03)00333-0

0 references

DBLP publication ID

journals/dam/Peeters03

1 reference

stated in

DBLP Dataset 2021-01-02

retrieved

28 January 2021

zbMATH Open document ID

1026.68068

0 references

(Q60680123)

The maximum edge biclique problem is NP-complete

Statements

Identifiers

Sitelinks

Wikipedia(0 entries)

Wikibooks(0 entries)

Wikinews(0 entries)

Wikiquote(0 entries)

Wikisource(0 entries)

Wikiversity(0 entries)

Wikivoyage(0 entries)

Wiktionary(0 entries)

Multilingual sites(0 entries)