"P Versus NPC: Minimum Steiner Trees in Convex Split Graphs."

A. Mohanapriya, P. Renjith, N. Sadagopan (2022)

> Home

Details and statistics

DOI: 10.1007/978-3-030-95018-7_10

access: closed

type: Conference or Workshop Paper

metadata version: 2022-01-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/caldam/MohanapriyaRS22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/caldam/MohanapriyaRS22
A. Mohanapriya, P. Renjith, N. Sadagopan:
P Versus NPC: Minimum Steiner Trees in Convex Split Graphs. CALDAM 2022: 115-126

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.