<--- Back to Details
First PageDocument Content
Clique / Line graph / Dominating set / Intersection number / Graph coloring / Chordal graph / Bron–Kerbosch algorithm / Maximal independent set / Clique-sum / Graph theory / Theoretical computer science / NP-complete problems
Date: 2007-08-21 06:18:22
Clique
Line graph
Dominating set
Intersection number
Graph coloring
Chordal graph
Bron–Kerbosch algorithm
Maximal independent set
Clique-sum
Graph theory
Theoretical computer science
NP-complete problems

Add to Reading List

Source URL: theinf1.informatik.uni-jena.de

Download Document from Source Website

File Size: 232,28 KB

Share Document on Facebook

Similar Documents

Bron–Kerbosch algorithm / Yelp / Inc. / Networks / Line graph / Clique problem / Graph theory / Clique / Graph operations

Poster: Spotting Suspicious Reviews via (Quasi-)clique Extraction Paras Jain, Shang-Tse Chen, Mozhgan Azimpourkivi† , Duen Horng Chau, Bogdan Carbunar† Georgia Tech, † Florida International University {paras, schen

DocID: 1fTrn - View Document

Graph operations / Clique / Bron–Kerbosch algorithm / Maximal independent set / Independent set / Line graph / Clique-sum / Graph theory / Theoretical computer science / NP-complete problems

doi:[removed]j.tcs[removed]

DocID: NoIH - View Document

Degeneracy / Clique problem / Community structure / Graph theory / Bron–Kerbosch algorithm / Clique

Review of the Bron-Kerbosch algorithm and variations Alessio Conte

DocID: 4IzR - View Document

NP-complete problems / Clique / Jaccard index / Maximal independent set / MinHash / Bron–Kerbosch algorithm / Independent set / Matching / Graph theory / Mathematics / Theoretical computer science

PDF Document

DocID: 14rN - View Document

Clique / Line graph / Dominating set / Intersection number / Graph coloring / Chordal graph / Bron–Kerbosch algorithm / Maximal independent set / Clique-sum / Graph theory / Theoretical computer science / NP-complete problems

PDF Document

DocID: 13QC - View Document