On disjoint paths in acyclic planar graphs

Computer Science – Discrete Mathematics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

We give an algorithm with complexity $O(f(R)^{k^2} k^3 n)$ for the integer multiflow problem on instances $(G,H,r,c)$ with $G$ an acyclic planar digraph and $r+c$ Eulerian. Here, $f$ is a polynomial function, $n = |V(G)|$, $k = |E(H)|$ and $R$ is the maximum request $\max_{h \in E(H)} r(h)$. When $k$ is fixed, this gives a polynomial algorithm for the arc-disjoint paths problem under the same hypothesis.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

On disjoint paths in acyclic planar graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On disjoint paths in acyclic planar graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On disjoint paths in acyclic planar graphs will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-189052

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.