✦ LIBER ✦

[Lecture Notes in Computer Science] SWAT 88 Volume 318 || Approximating the complete Euclidean graph

✍ Scribed by Karlsson, Rolf; Lingas, Andrzej

Book ID: 125431833
Publisher: Springer Berlin Heidelberg
Year: 1988
Weight: 302 KB
Category: Article
ISBN: 3540392882
DOI: 10.1007/3-540-19487-8_23

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] SWAT

[Lecture Notes in Computer Science] SWAT 88 Volume 318 || An implicit binomial queue with constant insertion time

✍ Karlsson, Rolf; Lingas, Andrzej 📂 Article 📅 1988 🏛 Springer Berlin Heidelberg ⚖ 785 KB

[Lecture Notes in Computer Science] Math

[Lecture Notes in Computer Science] Mathematical Foundations of Computer Science 2012 Volume 7464 || Approximate Graph Isomorphism

✍ Rovan, Branislav; Sassone, Vladimiro; Widmayer, Peter 📂 Article 📅 2012 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 237 KB

[Lecture Notes in Computer Science] Grap

[Lecture Notes in Computer Science] Graph-Theoretic Concepts in Computer Science Volume 570 || Approximating treewidth, pathwidth, and minimum elimination tree height

✍ Schmidt, Gunther; Berghammer, Rudolf 📂 Article 📅 1992 🏛 Springer Berlin Heidelberg ⚖ 748 KB

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithm Theory — SWAT '94 Volume 824 || Dominating cliques in distance-hereditary graphs

✍ Schmidt, Erik M.; Skyum, Sven 📂 Article 📅 1994 🏛 Springer Berlin Heidelberg ⚖ 649 KB

[Lecture Notes in Computer Science] STAC

[Lecture Notes in Computer Science] STACS 88 Volume 294 || On the k-colouring of circle-graphs

✍ Cori, Robert; Wirsing, Martin 📂 Article 📅 1988 🏛 Springer-Verlag 🌐 German ⚖ 647 KB

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithm Theory - SWAT 2000 Volume 1851 || Coping with the NP-Hardness of the Graph Bandwidth Problem

✍ Feige, Uriel 📂 Article 📅 2000 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 107 KB

This Book Constitutes The Refereed Proceedings Of The 7th Scandinavian Workshop On Algorithm Theory, Swat 2000, Held In Bergen, Norway, In July 2000. The 43 Revised Full Papers Presented Together With 3 Invited Contributions Were Carefully Reviewed And Selected From A Total Of 105 Submissions. The P