Login / Signup

Efficient Algorithms for Clique-Colouring and Biclique-Colouring Unichord-Free Graphs.

Hélio B. Macêdo FilhoRaphael C. S. MachadoCelina M. H. de Figueiredo
Published in: Algorithmica (2017)
Keyphrases
  • graph theoretic
  • graph properties
  • graph matching
  • independent set
  • graph representation
  • similarity measure
  • random graphs
  • maximum clique
  • special case
  • bipartite graph
  • fully connected
  • labeled graphs