dc.contributor.author |
Papadimitriou, CH |
en |
dc.contributor.author |
Yannakakis, M |
en |
dc.date.accessioned |
2014-03-01T01:05:59Z |
|
dc.date.available |
2014-03-01T01:05:59Z |
|
dc.date.issued |
1981 |
en |
dc.identifier.issn |
0020-0190 |
en |
dc.identifier.uri |
https://dspace.lib.ntua.gr/xmlui/handle/123456789/9107 |
|
dc.relation.uri |
http://www.scopus.com/inward/record.url?eid=2-s2.0-0019684494&partnerID=40&md5=301db27191b28b869edbf72e7427624c |
en |
dc.subject.classification |
Computer Science, Information Systems |
en |
dc.subject.other |
MATHEMATICAL TECHNIQUES - Graph Theory |
en |
dc.subject.other |
CLIQUE PROBLEM |
en |
dc.subject.other |
PLANAR GRAPHS |
en |
dc.subject.other |
COMPUTER PROGRAMMING |
en |
dc.title |
The clique problem for planar graphs |
en |
heal.type |
journalArticle |
en |
heal.language |
English |
en |
heal.publicationDate |
1981 |
en |
heal.abstract |
[No abstract available] |
en |
heal.publisher |
ELSEVIER SCIENCE BV |
en |
heal.journalName |
Information Processing Letters |
en |
dc.identifier.isi |
ISI:A1981NF75600001 |
en |
dc.identifier.volume |
13 |
en |
dc.identifier.issue |
4-5 |
en |
dc.identifier.spage |
131 |
en |
dc.identifier.epage |
133 |
en |