Publication

Optimal node disjoint paths on partial 2-trees: A linear algorithm and polyhedral results

Thomas Liebling, François Margot
1995
Journal paper

Abstract

We present an O(p*n) algorithm for the problem of finding disjoint simple paths of minimum total length between p given pairs of terminals on oriented partial 2-trees with n nodes and positive or negative arc lengths. The algorithm is in O(n) if all terminals are distinct nodes. We characterize the convex hull of the feasible solution set for the case p = 2.

Official source

https://infoscience.epfl.ch/record/77225?ln=en

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Optimal node disjoint paths on partial 2-trees: A linear algorithm and polyhedral results

Graph Chatbot

Chat with Graph Search

Better Trees for Santa Claus

Spectral Hypergraph Sparsifiers of Nearly Linear Size

Symbolic Algorithms for Token Swapping

Better Trees for Santa Claus

Spectral Hypergraph Sparsifiers of Nearly Linear Size

Symbolic Algorithms for Token Swapping