Computing the Clique-Width of Polygonal Tree Graphs.
J. Leonardo González-RuizJosé Raymundo Marcial-RomeroJosé Antonio Hernández ServínGuillermo De Ita LunaPublished in: MICAI (2) (2016)
Keyphrases
- maximum weight
- spanning tree
- maximum clique
- maximal cliques
- independent set
- graph properties
- graph theory
- minimum spanning tree
- graph theoretic
- tree structure
- maximal clique enumeration
- graph structure
- bipartite graph
- graph matching
- tree structures
- tree structured data
- reachability queries
- graph representation
- fully connected
- weighted graph
- hierarchical structure
- quasi cliques
- social networks