✦ LIBER ✦

A fast algorithm for computing sparse visibility graphs

✍ Scribed by S. Sudarshan; C. Pandu Rangan

Publisher: Springer
Year: 1990
Tongue: English
Weight: 667 KB
Volume: 5
Category: Article
ISSN: 0178-4617
DOI: 10.1007/bf01840385

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Matching Algorithms Are Fast in Sparse R

Matching Algorithms Are Fast in Sparse Random Graphs

✍ Holger Bast; Kurt Mehlhorn; Guido Schafer; Hisao Tamaki 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 179 KB

A perfect matching algorithm for sparse

A perfect matching algorithm for sparse bipartite graphs

✍ Eugeniusz Toczyłowski 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 366 KB

A linear algorithm for computing the vis

A linear algorithm for computing the visibility polygon from a point

✍ H El Gindy; D Avis 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 501 KB

A sparse multiresolution technique for f

A sparse multiresolution technique for fast capacitance computation

✍ Vikram Jandhyala; Eric Michielssen; Raj Mittra 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 637 KB

A technique for mpidly computing the capacitances of two-dimensional conducting structures is presented in fhis article. The method relies on a sparse multiresolution representation of the interactions between subsections of the conductors. This decomposition is used to substantially reduce the comp

A fast algorithm for reliability calcula

A fast algorithm for reliability calculations in sparse networks

✍ Dr. N. Spyratos; A. Bowen 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 767 KB

A fast algorithm for coloring Meyniel gr

A fast algorithm for coloring Meyniel graphs

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