Algorithmic and Hardness Results for the Colorful Components Problems

Adamaszek, Anna; Popa, Alexandru

doi:10.1007/s00453-014-9926-0

Local TagsRelease HistoryDetailsSummary

Algorithmic and Hardness Results for the Colorful Components Problems

Adamaszek, A., & Popa, A. (2015). Algorithmic and Hardness Results for the Colorful Components Problems. Algorithmica, 73(2), 371-388. doi:10.1007/s00453-014-9926-0.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0028-66B9-D Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0028-66BA-B

Genre: Journal Article

Files

show Files

Locators

show

Creators

show

hide

Creators:
Adamaszek, Anna¹, Author
Popa, Alexandru¹, Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

show

hide

Language(s): eng - English

Dates: Published Online: 2015Date issued: 2015

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: -

Identifiers: BibTex Citekey: Adamaszek_Algorithmica2015
DOI: 10.1007/s00453-014-9926-0

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: Algorithmica

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: New York, NY : Springer

Pages: - Volume / Issue: 73 (2) Sequence Number: - Start / End Page: 371 - 388 Identifier: ISSN: 0178-4617
CoNE: https://pure.mpg.de/cone/journals/resource/954925487793