A Deterministic(O(m log {m}))Time Algorithm for the Reeb Graph

[ACM Press the 2012 symposuim - Chapel H

[ACM Press the 2012 symposuim - Chapel Hill, North Carolina, USA (2012.06.17-2012.06.20)] Proceedings of the 2012 symposuim on Computational Geometry - SoCG '12 - A deterministic o(m log m) time algorithm for the reeb graph

✍ Parsa, Salman 📂 Article 📅 2012 🏛 ACM Press ⚖ 895 KB

[ACM Press the 2012 symposuim - Chapel H

[ACM Press the 2012 symposuim - Chapel Hill, North Carolina, USA (2012.06.17-2012.06.20)] Proceedings of the 2012 symposuim on Computational Geometry - SoCG '12 - A deterministic o(m log m) time algorithm for the reeb graph

✍ Parsa, Salman 📂 Article 📅 2012 🏛 ACM Press 🌐 English ⚖ 895 KB

We present a deterministic algorithm to compute the Reeb graph of a PL real-valued function on a simplicial complex in O(m log m) time, where m is the size of the 2-skeleton. The problem reduces to dynamic graph connectivity. We obtain the running time by using offline graph connectivity which assum

An O(n log n + m log log n) maximum weig

An O(n log n + m log log n) maximum weight clique algorithm for circular-arc graphs

✍ Wei-Kuan Shih; Wen-Lian Hsu 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 852 KB

An O(n log m) algorithm for the Josephus

An O(n log m) algorithm for the Josephus Problem

✍ Errol L Lloyd 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 458 KB

An O(n-log-log-n) Time Algorithm for Con

An O(n-log-log-n) Time Algorithm for Constructing a Graph of Maximum Connectivity with Prescribed Degrees

✍ T. Asano 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 601 KB

An O(log m) parallel algorithm for the m

An O(log m) parallel algorithm for the minimum spanning tree problem

✍ Francis Suraweera; Prabir Bhattacharya 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 481 KB