## Abstract We introduce the notion of __H__βlinked graphs, where __H__ is a fixed multigraph with vertices __w__~1~,β¦,__w__~m~. A graph __G__ is __H__β__linked__ if for every choice of vertices Ο ~1~,β¦, Ο ~m~ in __G__, there exists a subdivision of __H__ in __G__ such that Ο ~i~ is the branch vertex
LINK: a system for graph computation
β Scribed by J. Berry; Nathaniel Dean; Mark K. Goldberg; Gregory E. Shannon; Steven Skiena
- Publisher
- John Wiley and Sons
- Year
- 2000
- Tongue
- English
- Weight
- 145 KB
- Volume
- 30
- Category
- Article
- ISSN
- 0038-0644
No coin nor oath required. For personal study only.
β¦ Synopsis
This paper describes the LINK software system, which provides not only a graph editor and graph library, but a computing environment that employs object-oriented Scheme to provide a flexible workbench for algorithm learners and experimenters.
π SIMILAR VOLUMES
## Abstract Information overload on the Web has created enormous challenges to customers selecting products for online purchases and to online businesses attempting to identify customers' preferences efficiently. Various recommender systems employing different data representations and recommendatio
## Abstract For a fixed (multi)graph __H__, a graph __G__ is __Hβlinked__ if any injection __f__: __V__(__H__)β__V__(__G__) can be extended to an __H__βsubdivision in __G__. The notion of an __H__ βlinked graph encompasses several familiar graph classes, including __k__βlinked, __k__βordered and __