.

Browsing by Subject "Graph theory"

LAUR Repository

Browsing by Subject "Graph theory"

Sort by: Order: Results:

  • Maximal clique enumeration. (c2007) 
    Barghout, Hamed (Lebanese American University, 2011-11-17)
    Maximal clique enumeration is one of the most important tools for solving problems in a wide variety of application domains. Classical enumeration techniques suffer from being too slow on large scale data. New techniques, ...
  • The planar connected face-dominating set problem. (c2015) 
    Hage-Ali, Dina Y. (Lebanese American University, 2016-01-28)
    In the Planar Connected Face-Dominating Set problem, we are given a plane graph G and asked to find a connected subgraph T of minimum weight, or order, such that the boundary of every face of G contains at least one element ...