✦ LIBER ✦

Fast Enumeration Algorithms for Non-crossing Geometric Graphs

✍ Scribed by Naoki Katoh; Shin-Ichi Tanigawa

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A fast graph traversal algorithm for the

✍ M.M. Balakrishnarajan; P. Venuvanalingam 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 493 KB

Fast algorithms for edge-coloring planar

✍ Marek Chrobak; Moti Yung 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 963 KB

An algorithm for enumerating simple chai

✍ L.I. Kicha; E.I. Litvak 📂 Article 📅 1975 🏛 Elsevier Science ⚖ 171 KB

A basis enumeration algorithm for linear

✍ David Avis; Komei Fukuda 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 360 KB

A fast algorithm for coloring Meyniel gr

✍ A Hertz 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 557 KB

Edge crossing minimization algorithm for

✍ Shen Wei-xiang; Huang Jing-wei 📂 Article 📅 2001 🏛 Wuhan University 🌐 English ⚖ 486 KB