✦ LIBER ✦

A Linear-Time Algorithm for Finding a Maximal Planar Subgraph

✍ Scribed by Djidjev, Hristo N.

Book ID: 118197269
Publisher: Society for Industrial and Applied Mathematics
Year: 2006
Tongue: English
Weight: 214 KB
Volume: 20
Category: Article
ISSN: 0895-4801
DOI: 10.1137/s0895480197328771

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Better Approximation Algorithm for Fin

A Better Approximation Algorithm for Finding Planar Subgraphs

✍ Gruia Călinescu; Cristina G Fernandes; Ulrich Finkler; Howard Karloff 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 321 KB

The MAXIMUM PLANAR SUBGRAPH problemᎏgiven a graph G, find a largest planar subgraph of Gᎏhas applications in circuit layout, facility layout, and graph drawing. No previous polynomial-time approximation algorithm for this NP-Complete problem was known to achieve a performance ratio larger than 1r3,

A linear algorithm for finding Hamiltoni

A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs

✍ Takao Asano; Shunji Kikuchi; Nobuji Saito 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 901 KB

A linear-time algorithm for finding a sp

A linear-time algorithm for finding a sparsek-connected spanning subgraph of ak-connected graph

✍ Hiroshi Nagamochi; Toshihide Ibaraki 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 684 KB

A fast algorithm for finding an edge-max

A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring

✍ Egon Balas 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 540 KB

A linear time algorithm for the Bottlene

A linear time algorithm for the Bottleneck Biconnected Spanning Subgraph problem

✍ Gurmeet Singh Manku 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 621 KB

A linear-time algorithm for finding a mi

A linear-time algorithm for finding a minimum spanning pseudoforest

✍ Harold N. Gabow; Robert E. Tarjan 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 460 KB