✦ LIBER ✦

A note on computing a maximal planar subgraph using PQ-trees

✍ Scribed by Junger, M.; Leipert, S.; Mutzel, P.

Book ID: 119778347
Publisher: IEEE
Year: 1998
Tongue: English
Weight: 185 KB
Volume: 17
Category: Article
ISSN: 0278-0070
DOI: 10.1109/43.709399

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on strong embeddings of maximal p

A note on strong embeddings of maximal planar graphs on non-orientable sufraces

✍ Liu Tongyin; Liu Yanpei 📂 Article 📅 2001 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 175 KB

A note on maximizing the minimum voter s

A note on maximizing the minimum voter satisfaction on spanning trees

✍ Andreas Darmann; Christian Klamler; Ulrich Pferschy 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 286 KB

A note on the derivation of maximal comm

A note on the derivation of maximal common subgraphs of two directed or undirected graphs

✍ G. Levi 📂 Article 📅 1973 🏛 Springer Milan 🌐 English ⚖ 538 KB

A note on multikey sorting using modifie

A note on multikey sorting using modified binary insertion trees

✍ Abid M. Elabdalla 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 491 KB

A note on a simple computation of the ma

A note on a simple computation of the maximal suffix of a string

✍ Adamczyk, Zbigniew; Rytter, Wojciech 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 127 KB

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms — ESA 2002 Volume 2461 || Translating a Planar Object to Maximize Point Containment

✍ Möhring, Rolf; Raman, Rajeev 📂 Article 📅 2002 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 228 KB

This volume contains the 74 contributed papers and abstracts of 4 of the 5 invited talks presented at the 10th Annual European Symposium on Algorithms (ESA 2002), held at the University of Rome “La Sapienza”, Rome, Italy, 17-21 September, 2002. For the ?rst time, ESA had two tracks, with separate pr