The Isoperimetric Problem On Trees And Bounded Tree Width Graphs

The Isoperimetric Problem On Trees And Bounded Tree Width Graphs

In this thesis we study the isoperimetric problem on trees and graphs with bounded treewidth. Let G = (V,E) be a finite, simple and undirected graph. For let δ(S,G)= {(u,v) ε E : u ε S and v ε V – S }be the edge boundary of S. Given an integer i, 1 ≤ i ≤ | V| , let the edge isoperimetric value of...

Full description

Bibliographic Details
Main Author: Bharadwaj, Subramanya B V
Other Authors: Chandran, Sunil
Language:en_US
Published: 2010
Subjects:
Computer Graphics - Algorithms
Computer Graphics - Mathematical Models
Isoperimetric Inequalities
Meta-Fibonacci Sequences
Graph Theory
Trees (Graph Theory)
Treewidth Graphs
Weighted Graphs
Infinite Binary Tree
Isoperimetric Problem
Computer Science
Online Access:http://hdl.handle.net/2005/844

Internet

http://hdl.handle.net/2005/844

Similar Items