✦ LIBER ✦

A genetic algorithm for the maximum edge-disjoint paths problem

✍ Scribed by Hsu, Chia-Chun; Cho, Hsun-Jung

Book ID: 126543222
Publisher: Elsevier Science
Year: 2015
Tongue: English
Weight: 394 KB
Volume: 148
Category: Article
ISSN: 0925-2312
DOI: 10.1016/j.neucom.2012.10.046

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Maximum Edge-Disjoint Paths Problem

The Maximum Edge-Disjoint Paths Problem in Bidirected Trees

✍ Erlebach, Thomas; Jansen, Klaus 📂 Article 📅 2001 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 310 KB

The maximum edge-disjoint paths problem

The maximum edge-disjoint paths problem in complete graphs

✍ Adrian Kosowski 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 426 KB

On the maximum disjoint paths problem on

On the maximum disjoint paths problem on edge-colored graphs

✍ Bang Ye Wu 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 298 KB

Simple On-Line Algorithms for the Maximu

Simple On-Line Algorithms for the Maximum Disjoint Paths Problem

✍ Petr Kolman; Christian Scheideler 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 380 KB

An Improved Algorithm for the Half-Disjo

An Improved Algorithm for the Half-Disjoint Paths Problem

✍ Kawarabayashi, Ken-ichi; Kobayashi, Yusuke 📂 Article 📅 2011 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 173 KB

A simple linear algorithm for the edge-d

A simple linear algorithm for the edge-disjoint (s, t)-paths problem in undirected planar graphs

✍ Laurent Coupry 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 400 KB

Let G = (v!E) be an undirected planar graph, and s, 1 E V, s # f. We present a linear algorithm to compute a set of edge-disjoint (s, t)-paths of maximum cardinality in G. In other words, the problem is to find a maximum unit flow from s to r in a non-weighted graph. The main purpose is not to show