Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
COCOON
/
Paper
On the Complexity of k-Metric Antidimension Problem and the Size of k-Antiresolving Sets in Random Graphs.
Congsong Zhang
,
Yong Gao
Venue
National
COCOON
Year
2017
Proceedings
COCOON
DBLP record
conf/cocoon/ZhangG17 ↗
Browse the full
COCOON paper archive
.