Complexity of modification problems for reciprocal best match graphs

Hellmuth, Marc; Geiß, Manuela; Stadler, Peter F.

doi:10.1016/j.tcs.2019.12.033

Local TagsRelease HistoryDetailsSummary

Complexity of modification problems for reciprocal best match graphs

Hellmuth, M., Geiß, M., & Stadler, P. F. (2020). Complexity of modification problems for reciprocal best match graphs. Theoretical computer science, 809, 384-393. doi:10.1016/j.tcs.2019.12.033.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/21.11116/0000-0008-5C11-E Version Permalink: https://hdl.handle.net/21.11116/0000-0008-5C12-D

Genre: Journal Article

Files

show Files

Locators

show

Creators

show

hide

Creators:
Hellmuth, Marc¹, Author
Geiß, Manuela, Author
Stadler, Peter F.¹, Author

Affiliations:
1Max Planck Institute for Mathematics in the Sciences, Max Planck Society, ou_3039308

Content

show

Details

show

hide

Language(s):

Dates: Date issued: 2020

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: -

Identifiers: DOI: 10.1016/j.tcs.2019.12.033
Other: 85651

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: Theoretical computer science

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: -

Pages: - Volume / Issue: 809 Sequence Number: - Start / End Page: 384 - 393 Identifier: ISSN: 0304-3975