𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the complexity of finding even pairs in planar perfect graphs

✍ Scribed by Rudini M. Sampaio; Cléudia L. Sales

Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
271 KB
Volume
7
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the complexity of finding a local max
On the complexity of finding a local maximum of functions on discrete planar subsets
✍ Anton Mityagin 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 237 KB

We study how many values of an unknown integer-valued function f one needs to know in order to ÿnd a local maximum of f. We consider functions deÿned on ÿnite subsets of discrete plane. We prove upper bounds for functions deÿned on rectangles and present lower bounds for functions deÿned on arbitrar

On the complexity of deadlock detection
On the complexity of deadlock detection in families of planar nets
✍ Bruno Durand; Anne-Cécile Fabret 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 981 KB

We are interested in some properties of massively parallel computers which we model by finite automata connected together on a 2-dimensional grid. We wonder whether it is possible to anticipate a possible appearance of a deadlock in such nets. Thus, we look for efficient algorithms to predict whethe

On the maximum number of cycles in a pla
On the maximum number of cycles in a planar graph
✍ R. E. L. Aldred; Carsten Thomassen 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 142 KB 👁 2 views

## Abstract Let __G__ be a graph on __p__ vertices with __q__ edges and let __r__ = __q__ − __p__ = 1. We show that __G__ has at most ${15\over 16} 2^{r}$ cycles. We also show that if __G__ is planar, then __G__ has at most 2^__r__ − 1^ = __o__(2^__r__ − 1^) cycles. The planar result is best possib

On the number of hamiltonian cycles in a
On the number of hamiltonian cycles in a maximal planar graph
✍ S. L. Hakimi; E. F. Schmeichel; C. Thomassen 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 243 KB 👁 2 views

## Abstract We consider the problem of the minimum number of Hamiltonian cycles that could be present in a Hamiltonian maximal planar graph on __p__ vertices. In particular, we construct a __p__‐vertex maximal planar graph containing exactly four Hamiltonian cycles for every __p__ ≥ 12. We also pro