✦ LIBER ✦

An algorithm for determining the automorphism partitioning of an undirected graph

✍ Scribed by D. G. Corneil

Publisher: Springer Netherlands
Year: 1972
Tongue: English
Weight: 563 KB
Volume: 12
Category: Article
ISSN: 0006-3835
DOI: 10.1007/bf01932810

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for generating minimal cuts

An algorithm for generating minimal cutsets of undirected graphs

✍ Shin, Yong Yeon ;Koh, Jai Sang 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 250 KB

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 algorithm for partitioning

An efficient algorithm for partitioning an oriented graph into bicomponents

✍ L. Ya. Leifman 📂 Article 📅 1968 🏛 Springer US 🌐 English ⚖ 359 KB

A fully-pipelined systolic algorithm for

A fully-pipelined systolic algorithm for finding bridges on an undirected connected graph

✍ Su-Chu Hsu; Hsien-Fen Hsieh; Shing-Tsaan Huang 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 905 KB

An algorithm for determining the shortes

An algorithm for determining the shortest path on a network graph

✍ S.M. Alekseeva; O.G. Alekseev 📂 Article 📅 1971 🏛 Elsevier Science ⚖ 568 KB

An assumed partition algorithm for deter

An assumed partition algorithm for determining processor inter-communication

✍ A.H. Baker; R.D. Falgout; U.M. Yang 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 448 KB

The recent advent of parallel machines with tens of thousands of processors is presenting new challenges for obtaining scalability. A particular challenge for large-scale scientific software is determining the inter-processor communications required by the computation when a global description of th