Construction of vertex-disjoint paths in alternating group networks

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Vertex Disjoint Paths in Upward Planar Graphs

The k-vertex disjoint paths problem is one of the most studied problems in algorithmic graph theory. In 1994, Schrijver proved that the problem can be solved in polynomial time for every fixed k when restricted to the class of planar digraphs and it was a long standing open question whether it is fixed-parameter tractable (with respect to parameter k) on this restricted class. Only recently, [1...

متن کامل

An Efficient Construction of Node Disjoint Paths in OTIS Networks

We investigate the problem of constructing the maximal number of node disjoint paths between two distinct nodes in Swapped/OTIS networks. A general construction of node disjoint paths in any OTIS network with a connected basis network is presented, which is independent of any construction of node disjoint paths in its basis network. This general construction is effective and efficient, which ca...

متن کامل

Connecting Obstacles in Vertex-Disjoint Paths

Given a set of k disjoint convex polygonal obstacles inside a triangular container, we add straight-line noncrossing edges such that each obstacle has three vertex-disjoint paths to the container. We prove combinatorial bounds on the minimum number of edges that are always sufficient and sometimes necessary. Figure 1: A triangular container with disjoint convex obstacles.

متن کامل

Vertex Disjoint Paths for Dispatching in Railways

We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization, and routingin-rounds problem. Although all considered variants are NP-hard in planar graphs, restrictions on the location of the terminals, motivated by railway applications, lead to polynomially solvable cases for t...

متن کامل

Disjoint Paths in Networks

Networks are prevalent in our daily lives. Our body consists of networks of neurons interconnected by synapses. Our transportation networks enable us to commute between places easily. The Internet, our vast gateway of information, is made up of networks of worldwide computers. The power grid networks provide electricity, without which society (nowadays) might cease to function. Our social netwo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Journal of Supercomputing

سال: 2009

ISSN: 0920-8542,1573-0484

DOI: 10.1007/s11227-009-0304-7