✦ LIBER ✦

The Even Cycle Problem for Planar Digraphs

✍ Scribed by C. Thomassen

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 604 KB
Volume: 15
Category: Article
ISSN: 0196-6774
DOI: 10.1006/jagm.1993.1030

No coin nor oath required. For personal study only.

✦ Synopsis

We present a polynomial time algorithm for deciding if a planar digraph has a dicycle of even length. 1993 Academic Press, Inc.

📜 SIMILAR VOLUMES

The even-path problem for graphs and dig

The even-path problem for graphs and digraphs

✍ Andrea S. Lapaugh; Christos H. Papadimitriou 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 357 KB

A polynomial algorithm for the Hamiltoni

A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs

✍ Bang-Jensen, J�rgen; Gutin, Gregory; Yeo, Anders 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 382 KB 👁 2 views

We describe a polynomial algorithm for the Hamiltonian cycle problem for semicomplete multipartite digraphs. The existence of such an algorithm was conjectured in G.

A Simple Parallel Algorithm for the Sing

A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs

✍ Jesper L. Träff; Christos D. Zaroliagis 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 216 KB

We present a simple parallel algorithm for the single-source shortest path problem in planar digraphs with nonnegative real edge weights. The algorithm runs on the EREW PRAM model of parallel computation in O((n 2= +n 1&= ) log n) time, performing O(n 1+= log n) work for any 0<=<1Â2. The strength of

The Minimum Spanning Strong Subdigraph P

The Minimum Spanning Strong Subdigraph Problem for Extended Semicomplete Digraphs and Semicomplete Bipartite Digraphs

✍ Jørgen Bang-Jensen; Anders Yeo 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 148 KB

We consider the problem (minimum spanning strong subdigraph (MSSS)) of finding the minimum number of arcs in a spanning strongly connected subdigraph of a strongly connected digraph. This problem is NP-hard for general digraphs since it generalizes the Hamiltonian cycle problem. We characterize the

Bounds of the longest directed cycle len

Bounds of the longest directed cycle length for minimal strong digraphs

✍ Zhi-bo Chen; Fu-ji Zhang 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 532 KB

In this paper we present the upper and lower bounds of the longest directed cycle length for minimal strr,ng digraphs in terms of the numbers of vertices and arcs. These bounds are both sharp. In addition, we give analogous results for minimal 2-edge connected graphs.

The intersection problem for m-cycle sys

The intersection problem for m-cycle systems

✍ Elizabeth J. Billington 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 794 KB

Let Z,(v) denote the set of integers k for which a pair of m-cycle systems of K , exist, on the same vertex set, having k common cycles. Let J,(v) = { 0,1,2, . . . ,t, -2, t,} where t , = v(vl ) / 2 m . In this article, if 2mn + x is an admissible order of an m-cycle system, we investigate when Zm(2