✦ LIBER ✦

On the sphericity testing of single source digraphs

✍ Scribed by Ardeshir Dolati; S. Mehdi Hashemi

Book ID: 108113744
Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 263 KB
Volume: 308
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2006.09.053

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal Upward Planarity Testing of Sing

Optimal Upward Planarity Testing of Single-Source Digraphs

✍ Bertolazzi, Paola; Di Battista, Giuseppe; Mannino, Carlo; Tamassia, Roberto 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 698 KB

Testing the Sphericity of Short Radii Co

Testing the Sphericity of Short Radii Convex Surfaces

✍ De Vany, A. S. ;Cooke, Frank 📂 Article 📅 1974 🏛 The Optical Society 🌐 English ⚖ 292 KB

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

Testing the -disconnectivity of graphs a

Testing the -disconnectivity of graphs and digraphs

✍ Yuichi Yoshida; Yusuke Kobayashi 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 393 KB

On the sphericity and cubicity of graphs

✍ Peter C Fishburn 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 535 KB

On the Capacity of Digraphs

✍ Noga Alon 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 76 KB

For a digraph G = (V, E) let w(G n ) denote the maximum possible cardinality of a subset S of V n in which for every ordered pair It is also shown that for every n there is a tournament T on 2n vertices whose capacity is at least √ n, whereas the maximum number of vertices in a transitive subtourna