✦ LIBER ✦

Solving Connected Dominating Set Faster than 2n

✍ Scribed by Fedor V. Fomin; Fabrizio Grandoni; Dieter Kratsch

Publisher: Springer
Year: 2007
Tongue: English
Weight: 371 KB
Volume: 52
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-007-9145-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Solving satisfiability in less than 2n s

Solving satisfiability in less than 2n steps

✍ B. Monien; E. Speckenmeyer 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 360 KB

The Khalimsky topologies are precisely t

The Khalimsky topologies are precisely those simply connected topologies on Zn whose connected sets include all 2n-connected sets but no (3n−1)-disconnected sets

✍ T.Yung Kong 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 270 KB

We give a proof of the result stated in the title. Here the concepts of 2n-and (3 n -1)-(dis)connected sets are the natural generalizations to Z n of the standard concepts of 4-and 8-(dis)connected sets in 2D digital topology. Suppose we have an n-dimensional scanner that digitizes n-dimensional ob

AnO(n2) active set method for solving a

AnO(n2) active set method for solving a certain parametric quadratic program

✍ M. J. Best; N. Chakravarti 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 600 KB

A heuristic method of solving nonlinear

A heuristic method of solving nonlinear problems of the elliptic type for doubly connected regions: PMM vol. 42, n≗2, 1978, pp. 321–326

✍ A.D. Chernyshov 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 389 KB