Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
AAIM
/
Paper
Polynomial Time Algorithm for k-vertex-edge Dominating Problem in Interval Graphs.
Peng Li
,
Aifa Wang
Venue
C
AAIM
Year
2022
Proceedings
AAIM
DBLP record
conf/aaim/LiW22 ↗
Browse the full
AAIM paper archive
.