𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Simple linear flow decomposition algorithms on trees, circles, and augmented trees

✍ Scribed by Balachandran Vaidyanathan

Book ID
112163201
Publisher
John Wiley and Sons
Year
2012
Tongue
English
Weight
107 KB
Volume
60
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Performance of parallel spanning tree al
Performance of parallel spanning tree algorithms on linear arrays of transputers and unix systems
✍ Sajal K. Das; Cui-Qing Yang πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 1019 KB

Das, S.K. and C-Q. Yang, Performance of parallel spanning tree algorithms on linear arrays of transputers and Unix systems, Parallel Computing 17 (1991) 527-551. This paper presents empirical performance of parallel algorithms for connected graphs on the transputer and Unix systems, where processes

A linear-time algorithm for connectedr-d
A linear-time algorithm for connectedr-domination and Steiner tree on distance-hereditary graphs
✍ BrandstοΏ½dt, Andreas; Dragan, Feodor F. πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 83 KB πŸ‘ 1 views

A distance-hereditary graph is a connected graph in which every induced path is isometric, i.e., the distance of any two vertices in an induced path equals their distance in the graph. We present a linear time labeling algorithm for the minimum cardinality connected r-dominating set and Steiner tree