A greedy approximation for minimum connected dominating sets 论文

2004Theoretical Computer Science引用 223
DOI
Complexity and Algorithms in GraphsAdvanced Graph Theory ResearchMobile Ad Hoc Networks
Advanced Graph Theory ResearchComplexity and Algorithms in GraphsMobile Ad Hoc Networks
相关技术:Mobile Ad Hoc NetworksComplexity and Algorithms in Graphs
关系图谱

A greedy approximation for minimum connected dominating sets · 作者

K

Ker‐I Ko

Y

Yingshu Li

W

Weili Wu

X

Xiaohua Jia

H

Hongwei Du

L

Lu Ruan