Iterated Clique Reductions in Vertex Weighted Coloring for Large Sparse Graphs.
Yi FanZaijun ZhangQuan YuYongxuan LaiKaile SuYiyuan WangShiwei PanLongin Jan LateckiPublished in: Entropy (2023)
Keyphrases
- maximum weight
- minimum weight
- weighted graph
- edge weights
- directed graph
- maximum clique
- independent set
- association graph
- undirected graph
- betweenness centrality
- graph properties
- attributed graphs
- bipartite graph
- hamiltonian cycle
- maximum cardinality
- vertex set
- labeled graphs
- spanning tree
- graph matching
- sparse data
- connected subgraphs
- greedy heuristic
- shortest path
- gaussian graphical models
- graph representation
- graph partitioning
- efficient computation
- average degree
- quasi cliques
- sparse coding
- directed acyclic
- graph clustering
- strongly connected
- high dimensional
- graph databases
- directed acyclic graph
- graph structure
- branch and bound algorithm
- sparse representation
- np hard