Approximating Layout Problems on Random Geometric Graphs

Author： Díaz J.   Penrose M.D.   Petit J.   Serna M.  

Publisher： Academic Press

ISSN： 0196-6774

Source： Journal of Algorithms, Vol.39, Iss.1, 2001-04, pp. : 78-116

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Maker‐breaker games on random geometric graphs

By  

RANDOM STRUCTURES AND ALGORITHMS, Vol. 45, Iss. 4, 2014-12 ,pp. : 553-607

John Wiley & Sons Inc

Access to resources Recommend Favorite

Open problems on graphs arising from geometric topology

By Cavicchioli A.   Repovs D.   Skopenkov A.B.  

Topology and its Applications, Vol. 84, Iss. 1, 1998-04 ,pp. : 207-226

Elsevier

Access to resources Recommend Favorite

Approximating Clique and Biclique Problems

By Hochbaum D.S.  

Journal of Algorithms, Vol. 29, Iss. 1, 1998-10 ,pp. : 174-200

Academic Press

Access to resources Recommend Favorite

On the Number of Plane Geometric Graphs

By Aichholzer Oswin   Hackl Thomas   Huemer Clemens   Hurtado Ferran   Krasser Hannes   Vogtenhuber Birgit  

Graphs and Combinatorics, Vol. 23, Iss. 1, 2007-06 ,pp. : 67-84

Springer Publishing Company

Access to resources Recommend Favorite

Approximating the Bandwidth for Asteroidal Triple-Free Graphs

By Kloks T.   Kratsch D.   Müller H.  

Journal of Algorithms, Vol. 32, Iss. 1, 1999-07 ,pp. : 41-57

Academic Press

Access to resources Recommend Favorite