✦ LIBER ✦

An algorithm for transitive reduction of an acyclic graph

✍ Scribed by David Gries; Alain J. Martin; Jan L.A. van de Snepscheut; Jan Tijmen Udding

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 244 KB
Volume: 12
Category: Article
ISSN: 0167-6423
DOI: 10.1016/0167-6423(89)90039-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient parallel algorithm for the

An efficient parallel algorithm for the transitive closure of a graph

✍ P. Fraisse 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 377 KB

An algorithm for frontwidth reduction

✍ Heitor L. G. Pina 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 557 KB

An algorithm for drawing planar graphs

✍ Bor Plestenjak 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 382 KB 👁 2 views

A simple algorithm for drawing 3-connected planar graphs is presented. It is derived from the Fruchterman and Reingold spring embedding algorithm by deleting all repulsive forces and fixing vertices of an outer face. The algorithm is implemented in the system for manipulating discrete mathematical s

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 the reduction of finite

An algorithm for the reduction of finite non-oriented graphs to canonical form

✍ V.L. Arlazarov; I.I. Zuev; A.V. Uskov; I.A. Faradzhev 📂 Article 📅 1974 🏛 Elsevier Science ⚖ 570 KB

An improved algorithm for relational dis

An improved algorithm for relational distance graph matching

✍ L. Cinque; D. Yasuda; L.G. Shapiro; S. Tanimoto; B. Allen 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 914 KB