✦ LIBER ✦

A note on shortest superstrings with flipping

✍ Scribed by Tao Jiang; Ming Li; Ding-zhu Du

Book ID: 103102078
Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 410 KB
Volume: 44
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(92)90084-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on the superstring BRST operator

✍ José N. Acosta; Nathan Berkovits; Osvaldo Chandı́a 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 39 KB

A note on k-shortest paths problem

✍ Nick Gravin; Ning Chen 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 66 KB 👁 1 views

It is well-known that in a directed graph, if deleting any edge will not affect the shortest distance between two specific vertices s and t, then there are two edge-disjoint paths from s to t and both of them are shortest paths. In this article, we generalize this to shortest k edgedisjoint s-t path

A note on finding shortest path trees

✍ Aaron Kershenbaum 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 107 KB 👁 1 views

A note on Delaunay diagonal flips

✍ Steven Fortune 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 434 KB

A note on the stochastic shortest-route

A note on the stochastic shortest-route problem

✍ John S. Croucher 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 174 KB 👁 1 views

A note on the constrained shortest-path

A note on the constrained shortest-path problem

✍ Arun K. Pujari; Suneeta Agarwal; V. P. Gulati 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 135 KB 👁 1 views