Searching for "There Are Planar Graphs Almost as Good as the Complete Graphs and Almost as Cheap as Minimum Spanning Trees." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

There are planar graphs almost as good as the complete graphs and almost as cheap as minimum
by Christos Levcopoulos, Andrzej Lingas — 1992 — Algorithmica
… Graphs Almost as Good as the Complete Graphs and Almost as Cheap as Minimum Spanning Trees Christos…
Cited by 26 (0 self) – Add To MetaCart

S.: Local Approximation Schemes for Topology Control
by Mirela Damian — 2006 — In: Proc. of the 25 th Annual ACM Symposium on Principles of Distributed Computing (PODC). (2006
…] in which the authors show that there are “planar graphs almost as good as the complete graphs and almost…
Cited by 2 (0 self) – Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB