Induced Disjoint Paths in Circular-Arc Graphs in Linear Time

Golovach, P.A.; Paulusma, D.; van Leeuwen, E.J.

Abstract

The Induced Disjoint Paths problem is to test whether a graph G with k distinct pairs of vertices (si,ti) contains paths P1,…,Pk such that Pi connects si and ti for i=1,…,k, and Pi and Pj have neither common vertices nor adjacent vertices (except perhaps their ends) for 1≤i

Citation

Golovach, P., Paulusma, D., & van Leeuwen, E. (2014, December). Induced Disjoint Paths in Circular-Arc Graphs in Linear Time. Presented at 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France

• Presentation Conference Type: Conference Paper (Published)
• Conference Name: 40th International Workshop, WG 2014
• Publication Date: Jan 1, 2014
• Deposit Date: Dec 20, 2014
• Publicly Available Date: Jan 17, 2015
• Print ISSN: 0302-9743
• Pages: 225-237
• Series Title: Lecture notes in computer science
• Series Number: 8747
• Series ISSN: 0302-9743,1611-3349
• Book Title: 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, 25-27 June 2014 ; revised selected papers.
• ISBN: 978-3-319-12339-4
• DOI: https://doi.org/10.1007/978-3-319-12340-0_19
• Public URL: https://durham-repository.worktribe.com/output/1153916