✦ LIBER ✦

Parallel complexity of computing a maximal set of disjoint paths

✍ Scribed by Alok Aggarwal

Book ID: 107766017
Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 277 KB
Volume: 41
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(92)90044-v

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The complexity of finding maximum disjoi

The complexity of finding maximum disjoint paths with length constraints

✍ A. Itai; Y. Perl; Y. Shiloach 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 416 KB

An efficient parallel algorithm for comp

An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3

✍ Elias Dahlhaus; Marek Karpinski; Pierre Kelsen 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 375 KB

Complexity of Computing the Local Dimens

Complexity of Computing the Local Dimension of a Semialgebraic Set

✍ Nicolai Vorobjov 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 521 KB

The paper describes several algorithms related to a problem of computing the local dimension of a semialgebraic set. Let a semialgebraic set V be defined by a system of k inequalities of the form f ≥ 0 with f ∈ R[X 1 , . . . , Xn], deg(f ) < d, and x ∈ V . An algorithm is constructed for computing t

Algorithms for finding an optimal set of

Algorithms for finding an optimal set of short disjoint paths in a communication network

✍ Torrieri, D. 📂 Article 📅 1992 🏛 IEEE 🌐 English ⚖ 461 KB

An improvement on parallel computation o

An improvement on parallel computation of a maximal matching

✍ Yijie Han 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 481 KB

On Partitioning the Edge Set of a Graph

On Partitioning the Edge Set of a Graph into Internally Disjoint Paths without Exterior Vertices

✍ G. R. Vijayakumar 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 206 KB