Clique algorithm
The paper aims to find the maximum clique in a graph. The ideas presented here are important because it is difficult to find the maximum clique in larger graphs manually therefore implementing a software is highly recommended. The software created by Dhardwarker and Tan and Tan were both developed i...
Saved in:
Main Authors: | Tan, Majorvin N., Tan, Marc Andrew N. |
---|---|
Format: | text |
Language: | English |
Published: |
Animo Repository
2008
|
Subjects: | |
Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/7875 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | De La Salle University |
Language: | English |
Similar Items
-
Clique algorithm
by: Tan, Marjovin N., et al.
Published: (2008) -
Minimum 2-clique and 3-clique partitions of simple connected graphs
by: Alto, Washington Lee
Published: (1992) -
A common generalization of line graphs and clique graphs
by: Bernardo, Servando D., Jr.
Published: (2004) -
On labelling harmonious graphs
by: Fabros, Roland R., et al.
Published: (1998) -
On isomorphic, nonisomorphic and the number of tournaments from three tournament construction algorithms
by: Alvarez, Ryan T.
Published: (1999)