✦ LIBER ✦

An algorithm for graph optimal monomorphism

✍ Scribed by Wong, A.K.C.; You, M.; Chan, S.C.

Book ID: 114550786
Publisher: Institute of Electrical and Electronics Engineers
Year: 1990
Weight: 596 KB
Volume: 20
Category: Article
ISSN: 0018-9472
DOI: 10.1109/21.57275

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An optimal visibility graph algorithm fo

An optimal visibility graph algorithm for triangulated simple polygons

✍ John Hershberger 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 973 KB

An optimal algorithm for extracting the

An optimal algorithm for extracting the regions of a plane graph

✍ X.Y. Jiang; H. Bunke 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 420 KB

An optimal algorithm for cycle breaking

An optimal algorithm for cycle breaking in directed graphs

✍ Tatiana Orenstein; Zvi Kohavi; Irith Pomeranz 📂 Article 📅 1995 🏛 Springer US 🌐 English ⚖ 831 KB

An algorithm for optimal isomorphism bet

An algorithm for optimal isomorphism between two random graphs

✍ Dong Su Seong; Young Kyu Choi; Ho Sung Kim; Kyu Ho Park 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 449 KB

An Optimal Shortest Path Parallel Algori

An Optimal Shortest Path Parallel Algorithm for Permutation Graphs

✍ O.H. Ibarra; Q. Zheng 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 512 KB

We present an optimal parallel algorithm for the single-source shortest path problem for permutation graphs. The algorithm runs in \(O(\log n)\) time using \(O(n / \log n)\) processors on an EREW PRAM. As an application, we show that a minimum connected dominating set in a permutation graph can be f

Priority algorithms for graph optimizati

Priority algorithms for graph optimization problems

✍ Allan Borodin; Joan Boyar; Kim S. Larsen; Nazanin Mirmohammadi 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 972 KB