𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A new technique for optimization problems in graph theory

✍ Scribed by Shih-Yi Yuan; Sy-Yen Kuo

Book ID
119772807
Publisher
IEEE
Year
1998
Tongue
English
Weight
276 KB
Volume
47
Category
Article
ISSN
0018-9340

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An optimal problem in graph theory
An optimal problem in graph theory
✍ M. A. Dukhovnyi πŸ“‚ Article πŸ“… 1971 πŸ› SP MAIK Nauka/Interperiodica 🌐 English βš– 207 KB
A study on the tie-set graph theory and
A study on the tie-set graph theory and network flow optimization problems
✍ Toshio Koide; Haruki Kubo; Hitoshi Watanabe πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 198 KB πŸ‘ 2 views

## Abstract Aiming at establishing a firm basic theory to ring‐based information network management systems, our paper proposes a tie‐set graph theory. We define a binary vector representing a tie‐set in a biconnected undirected graph __G__=(__V__,__E__) as a tie‐set vector. The set of tie‐set vect

A problem in infinite graph-theory
A problem in infinite graph-theory
✍ R. Halin πŸ“‚ Article πŸ“… 1975 πŸ› Vandenhoeck & Ruprecht 🌐 German βš– 308 KB
A retraction problem in graph theory
A retraction problem in graph theory
✍ Alain Quilliot πŸ“‚ Article πŸ“… 1985 πŸ› Elsevier Science 🌐 English βš– 563 KB

Given two graphs G=(X,E), H=(Y,F); If AcX and if f is a function from A to Y, we pose the problem of deciding if f can be extended into a homomorphism from G to H. We know how to solve this problem when H is, for instance, a tree, or a chordal graph. We give here a solution to this problem when g is