Return to search

The embedding of complete bipartite graphs onto grids with a minimum grid cutwidth

Algorithms will be domonstrated for how to embed complete bipartite graphs onto 2xn type grids, where the imimum grid cutwidth is attained.

Identiferoai:union.ndltd.org:csusb.edu/oai:scholarworks.lib.csusb.edu:etd-project-3312
Date01 January 2003
CreatorsRocha, Mário
PublisherCSUSB ScholarWorks
Source SetsCalifornia State University San Bernardino
Detected LanguageEnglish
Typetext
Formatapplication/pdf
SourceTheses Digitization Project

Page generated in 0.0018 seconds