270 citations
- National Yang Ming Chiao Tung UniversityTW5 papers
- National Taiwan UniversityTW4 papers
- Institute of Statistical Science, Academia SinicaTW3 papers
- National Central UniversityTW2 papers
- National Taiwan Normal UniversityTW2 papers
- Academia SinicaTW1 paper
- Goethe University FrankfurtDE1 paper
- Indian Institute of Technology JodhpurIN1 paper
- Institute of Chemistry and Chemical TechnologyRU1 paper
- Institute of Information Science, Academia SinicaTW1 paper
- Institute of PhysicsPL1 paper
- Institute of Physics, Academia SinicaTW1 paper
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2016
A Linear-Time Algorithm for the Weighted Paired-Domination Problem on Block Graphs
Ching-Chi Lin, Cheng-Yu Hsieh
In a graph , a vertex subset is said to be a dominating set of if every vertex not in is adjacent to a vertex in . A dominating set of $…
cs.DS2014
Linear-Time Algorithms for the Paired-Domination Problem in Interval Graphs and Circular-Arc Graphs
Ching-Chi Lin, Hai-Lun Tu
In a graph , a vertex subset is said to be a dominating set of if every vertex not in is adjacent to a vertex in . A dominating set of a graph $…