| ［1］ |
Luo Zhi-hao, Li Jin, Yue Kun， et al．Mining Top-k summarization patterns for knowledge graphs ［J］.Journal of Tsinghua University (Science and Technology),2019,59(3):194-202.（in Chinese）
|
| ［2］ |
Lin H, Bilmes J. Multi-document summarization via budget- ed maximization of submodular functions［C］∥Proc of the 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics,2010:912-920.
|
| ［3］ |
Lin H, Bilmes J.A class of submodular functions for document summarization［C］∥Proc of the 49th Annual Meeting of the Association for Computational Linguistics:Human Language Technologies,2011:510-520.
|
| ［4］ |
Jayanth J,Sundararaj J,Bhattacharyya P.Monotone submodularity in opinion summaries［C］∥Proc of the 2015 Confe- rence on Empirical Methods in Natural Language Processing,2015:169-178.
|
| ［5］ |
Lu W Z,Janssen J,Milios E,et al.Node similarity in networked information space［D］. Halifax:Dalhousie University,2001．
|
| ［6］ |
Tiakas E,Papadopoulos A N,Manolopoulos Y.Graph node clustering via transitive node similarity［C］∥Proc of the 14th Panhellenic Conference on Informatics,2010:72-77.
|
| ［7］ |
Jeh G,Widom J.SimRank:A measure of structural-context similarity［C］∥Proc of the 8th International Conference on Knowledge Discovery and Data Mining,2002:538-543.
|
| ［8］ |
Wang F， Du H W，Camacho E，et al．On positive influence dominating sets in social networks［J］．Theoretical Computer Science，2011，412(3)：265-269．
|
| ［9］ |
Zhu X， Yu J，Lee W，et al．New dominating sets in social networks［J］．Journal of Global Optimization，2010，48(4)：633-642．
|
| ［10］ |
Tong G M，Wu W L，Pardalos P M，et al．On positive- influence target-domination［J］．Optimization Letters，2017，11(2)：419-427.
|
| ［11］ |
Khuller S, Raghavachari B,Rosenfeld A. Landmarks in graphs ［J］.Discrete Applied Mathematics,1996,70 (3):217-229.
|
| ［12］ |
Hauptmann M, Schmied R, Viehmann C.Approximation complexity of metric dimension problem ［J］.Journal of Discrete Algorithms,2012,14:214-222.
|
| ［13］ |
Huang Y F,Hou B, Liu W,et al.On approximation algorithm for the edge metric dimension problem［J］.Theoretical Computer Science,2021,853:2-6.
|
| ［14］ |
Wolsey L A．An analysis of the greedy algorithm for the submodular set covering problem［J］．Combinatorica，1982，2(4):385-393．
|
| ［15］ |
Wan P J，Du D Z，Pardalos P M，et al．Greedy approximations for minimum submodular cover with submodular cost［J］．Computational Optimization and Applications，2010，45(2):463-474．
|
|
附中文参考文献：
|
| ［1］ |
罗之皓,李劲,岳昆,等.知识图谱的Top-k摘要模式挖掘方法［J］.清华大学学报(自然科学版),2019,59(3):194-202.
|
