◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Taisheng Mu

2 papers hereh-index 24 citations7 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author2

Across the 2 of 2 papers where every author was matched, so the position is known.

fields
  • cs.DS2

identity via Semantic Scholar / OpenAlex

collaborators

2 papers

cs.DS2024

Optimal Algorithm for Paired-Domination in Distance-Hereditary Graphs

Ta-Yu Mu, Ching-Chi Lin

The domination problem and its variants represent a classical domain within algorithmic graph theory. Among these variants, the paired-domination problem holds particular prominenc…

cs.DS2024

Complexity of Paired Domination Problems on Circle and k-Polygon Graphs

Ta-Yu Mu, Ching-Chi Lin

A set D⊆V is a dominating set of a graph G if every vertex in V−D is adjacent to at least one vertex in D. A dominating set D is a paired-dominating set if th…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.