Updating the Vertex Separation of a Dynamically Changing Tree

Updating the Vertex Separation of a Dynamically Changing Tree

Show other versions (1)

This thesis presents several algorithms that update the vertex separation of a tree after the tree is modified; the vertex separation of a graph measures the largest number of vertices to the left of and including a vertex that are adjacent to vertices to the right of the vertex, when the vertices i...

Full description

Bibliographic Details
Main Author: Olsar, Peter
Format: Others
Language:en
Published: University of Waterloo 2006
Subjects:
Computer Science
algorithm
tree
graph
layout
vertex separation
cutwidth
linear ordering
VLSI design
amortized analysis
bounds
Online Access:http://hdl.handle.net/10012/1163

Internet

http://hdl.handle.net/10012/1163

Similar Items