Induced Disjoint Paths in Circular-Arc Graphs in Linear Time

Golovach, Petr A.; Paulusma, Daniël; van Leeuwen, Erik Jan

doi:10.1016/j.tcs.2016.06.003

Local TagsRelease HistoryDetailsSummary

Induced Disjoint Paths in Circular-Arc Graphs in Linear Time

Golovach, P. A., Paulusma, D., & van Leeuwen, E. J. (2016). Induced Disjoint Paths in Circular-Arc Graphs in Linear Time. Theoretical Computer Science, 640, 70-83. doi:10.1016/j.tcs.2016.06.003.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-002B-459D-2 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-002B-459E-F

Genre: Journal Article

Files

show Files

Locators

show

Creators

show

hide

Creators:
Golovach, Petr A.¹, Author
Paulusma, Daniël¹, Author
van Leeuwen, Erik Jan², Author

Affiliations:
1External Organizations, ou_persistent22
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

show

hide

Language(s): eng - English

Dates: Published Online: 2016Date issued: 2016

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: -

Identifiers: BibTex Citekey: GolovachTCS2016
DOI: 10.1016/j.tcs.2016.06.003

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: Amsterdam : Elsevier

Pages: - Volume / Issue: 640 Sequence Number: - Start / End Page: 70 - 83 Identifier: ISSN: 0304-3975
CoNE: https://pure.mpg.de/cone/journals/resource/954925512450