Hardness Results of Connected Power Domination for Bipartite Graphs and Chordal Graphs.
Pooja GoyalB. S. PandaPublished in: COCOA (2021)
Keyphrases
- bipartite graph
- maximum cardinality
- graph model
- maximum matching
- graph clustering
- minimum weight
- edge weights
- computational complexity
- maximum weight
- link prediction
- bipartite graph matching
- np hard
- labeled graphs
- undirected graph
- phase transition
- connected components
- np complete
- graph databases
- information retrieval
- bipartite networks
- random walk
- active learning
- learning algorithm