Login / Signup

Finding large cliques in arbitrary graphs by bipartite matching.

Egon BalasWilliam Niehaus
Published in: Cliques, Coloring, and Satisfiability (1993)
Keyphrases
  • bipartite matching
  • maximum clique
  • weighted graph
  • maximum weight
  • graph structure
  • maximal cliques
  • directed graph
  • special case
  • data objects
  • bipartite graph
  • graph theory
  • association graph
  • minimum cost flow