Edge clique partition in (k, ℓ)-graphs.
Átila A. JonesFábio ProttiRenata R. Del-VecchioPublished in: Discret. Appl. Math. (2022)
Keyphrases
- vertex set
- weighted graph
- undirected graph
- maximum weight
- maximum clique
- independent set
- graph matching
- graph properties
- edge detection
- quasi cliques
- minimum spanning trees
- graph theory
- graph theoretic
- graph partitioning
- edge information
- edge weights
- random graphs
- graph model
- directed graph
- edge map
- graph databases
- maximum independent set
- adjacency graph
- maximal clique enumeration
- social networks
- strongly connected
- graph representation
- graph structure
- branch and bound algorithm
- edge detector
- shortest path
- np hard