✦ LIBER ✦

On the Zone Complexity of a Vertex

✍ Scribed by Zerbib, Shira

Book ID: 118197122
Publisher: Society for Industrial and Applied Mathematics
Year: 2011
Tongue: English
Weight: 335 KB
Volume: 25
Category: Article
ISSN: 0895-4801
DOI: 10.1137/100787246

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Complexity of approximating the vertex c

Complexity of approximating the vertex centroid of a polyhedron

✍ Khaled Elbassioni; Hans Raj Tiwary 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 219 KB

On the complexity of vertex-disjoint len

On the complexity of vertex-disjoint length-restricted path problems

✍ Andreas Bley 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 277 KB

The Effect of Number of Hamiltonian Path

The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem

✍ Manber, Udi; Tompa, Martin 📂 Article 📅 1984 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 900 KB

Propagation of CR extendibility at the v

Propagation of CR extendibility at the vertex of a complex sector

✍ Baracco, Luca; Pinton, Stefano 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 161 KB

The Resolution Complexity of Independent

The Resolution Complexity of Independent Sets and Vertex Covers in Random Graphs

✍ Paul Beame; Russell Impagliazzo; Ashish Sabharwal 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 486 KB

Average-case complexity of shortest-path

Average-case complexity of shortest-paths problems in the vertex-potential model

✍ Colin Cooper; Alan Frieze; Kurt Mehlhorn; Volker Priebe 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 146 KB 👁 2 views

We study the average-case complexity of shortest-paths problems in the vertexpotential model. The vertex-potential model is a family of probability distributions on complete directed graphs with arbitrary real edge lengths, but without negative cycles. We show that on a graph with n vertices and wit