✦ LIBER ✦

An efficient algorithm for partitioning an oriented graph into bicomponents

✍ Scribed by L. Ya. Leifman

Publisher: Springer US
Year: 1968
Tongue: English
Weight: 359 KB
Volume: 2
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01073665

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient memetic algorithm for the g

An efficient memetic algorithm for the graph partitioning problem

✍ Philippe Galinier; Zied Boujbel; Michael Coutinho Fernandes 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 619 KB

An efficient approach for large scale gr

An efficient approach for large scale graph partitioning

✍ Renzo Zamprogno; André R. S. Amaral 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 428 KB

An algorithm for determining the automor

An algorithm for determining the automorphism partitioning of an undirected graph

✍ D. G. Corneil 📂 Article 📅 1972 🏛 Springer Netherlands 🌐 English ⚖ 563 KB

An efficient clustering algorithm for pa

An efficient clustering algorithm for partitioning parallel programs

✍ Piyush Maheshwari; Hong Shen 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 254 KB

This paper presents a clustering algorithm that partitions node-labelled and edge-labelled Ž . directed acyclic precedence graphs APG into clusters such that all the clusters have balanced amount of computation load and there is only one communication path between any pair of clusters. The algorithm

An algorithm for fraternal orientation o

An algorithm for fraternal orientation of graphs

✍ J. Urrutia; F. Gavril 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 339 KB

An Algorithm for Partitioning a Set into

An Algorithm for Partitioning a Set into Simple Parts

✍ L. Ya. Savel'ev 📂 Article 📅 2005 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 84 KB