Least resolved trees for two-colored best match graphs

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

doi:10.7155/jgaa.00564

Local TagsRelease HistoryDetailsSummary

Least resolved trees for two-colored best match graphs

Schaller, D., Geiß, M., Hellmuth, M., & Stadler, P. F. (2021). Least resolved trees for two-colored best match graphs. Journal of graph algorithms and applications, 25(1), 397-416. doi:10.7155/jgaa.00564.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/21.11116/0000-000A-8B85-3 Version Permalink: https://hdl.handle.net/21.11116/0000-000A-8B86-2

Genre: Journal Article

Files

show Files

Locators

show

Creators

show

hide

Creators:
Schaller, David¹, Author
Geiß, Manuela, Author
Hellmuth, Marc¹, 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: 2021

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: -

Identifiers: DOI: 10.7155/jgaa.00564
Other: 106422

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: Journal of graph algorithms and applications

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: -

Pages: - Volume / Issue: 25 (1) Sequence Number: - Start / End Page: 397 - 416 Identifier: ISSN: 1526-1719