Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

HEWN: A polynomial algorithm for CLIQUE problem

From MaRDI portal
Publication:1288412
Jump to:navigation, search

zbMath0920.68097MaRDI QIDQ1288412

Pushan Tang, Zhijun Huang

Publication date: 13 September 1999

Published in: Journal of Computer Science and Technology (Search for Journal in Brave)


zbMATH Keywords

CLIQUE problem


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)


Related Items (2)

Hardness and methods to solve CLIQUE ⋮ HEWN







This page was built for publication: HEWN: A polynomial algorithm for CLIQUE problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1288412&oldid=13396599"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 10:41.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki