✦ LIBER ✦

The price of connectivity for dominating set: Upper bounds and complexity

✍ Scribed by Camby, Eglantine; Schaudt, Oliver

Book ID: 126824374
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 393 KB
Volume: 177
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2014.05.029

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Kernels for below-upper-bound parameteri

Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems

✍ G. Gutin; M. Jones; A. Yeo 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 266 KB

The complexity of connected dominating s

The complexity of connected dominating sets and total dominating sets with specified induced subgraphs

✍ Schaudt, Oliver; Schrader, Rainer 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 152 KB

Upper bounds on the diameter of dominati

Upper bounds on the diameter of domination dot-critical graphs with given connectivity

✍ Furuya, Michitaka 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 424 KB

Some upper bounds for the atom–bond conn

Some upper bounds for the atom–bond connectivity index of graphs

✍ Jinsong Chen; Jianping Liu; Xiaofeng Guo 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 233 KB

The price of oil: Lower and upper bounds

✍ Michael B. Morrison 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 604 KB

Upper and lower bounds for the average-c

Upper and lower bounds for the average-case complexity of path-search

✍ Pippenger, Nicholas 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 125 KB 👁 1 views

A channel graph is the union of all paths between a given input and a given output in an interconnection network. At any moment in time, each vertex in such a graph is either idle or busy. The search problem that we consider is to find a path (from the given input to the given output) consisting ent