Old Web
English
Sign In
Acemap
>
Paper
>
A linear time algorithm for finding the minimum paired-dominating set in series-parallel graphs
A linear time algorithm for finding the minimum paired-dominating set in series-parallel graphs
2007
Toru Araki
Keywords:
Combinatorics
Dominating set
Series and parallel circuits
Time complexity
Mathematics
Graph
Correction
Source
Cite
Save
Machine Reading By IdeaReader
0
References
3
Citations
NaN
KQI
[]