𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient algorithms for synthesizing graphs with given sets of fundamental cuts and cycles

✍ Scribed by V. F. Rotko

Publisher
Springer US
Year
1986
Tongue
English
Weight
681 KB
Volume
22
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An efficient algorithm for searching imp
An efficient algorithm for searching implicit AND/OR graphs with cycles
✍ P. JimΓ©nez; C. Torras πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 371 KB

We present an efficient AO \* -like algorithm that handles cyclic graphs without neither unfolding the cycles nor looping through them. Its top-down search strategy is based on Mahanti and Bagchi's CF [J. ACM 32 (1985) 28], whereas its bottom-up revision process is inspired in Chakrabarti's REV \* [

A sharp upper bound for the number of st
A sharp upper bound for the number of stable sets in graphs with given number of cut edges
✍ Hongbo Hua πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 648 KB

Let G be a connected and simple graph, and let i(G) denote the number of stable sets in G. In this letter, we have presented a sharp upper bound for the i(G)-value among the set of graphs with k cut edges for all possible values of k, and characterized the corresponding extremal graphs as well.