This thesis studies approximation algorithms for two fundamental problems arising in graph theory: counting copies of one graph in another graph and estimating distances in geometric graphs.Additionally, if the base graph is a random graph from G(n, p) with constant p and if the template graph has an ordered ... bounded-degree C3-free outerplanar graph, bounded- degree [C3 , C5]-free series-parallel graph, or planar graphs ofanbsp;...

Title | : | Approximation Algorithms for Graph Problems |

Author | : | Shiva Prasad Kasiviswanathan |

Publisher | : | ProQuest - 2008 |

You must register with us as either a Registered User before you can Download this Book. You'll be greeted by a simple sign-up page.

Once you have finished the sign-up process, you will be redirected to your download Book page.

`1.`Register a free 1 month Trial Account.`2.`Download as many books as you like (Personal use)`3.`Cancel the membership at any time if not satisfied.