University of Illinois Urbana-Champaign

Equitable List Coloring, Induced Linear Forests, and Routing in Rooted Graphs

Pelsmajer, Michael Joshua

This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.

Permalink

https://hdl.handle.net/2142/86805

Description

Title
Equitable List Coloring, Induced Linear Forests, and Routing in Rooted Graphs
Author(s)
Pelsmajer, Michael Joshua
Issue Date
2002
Doctoral Committee Chair(s)
West, Douglas B.
Department of Study
Mathematics
Discipline
Mathematics
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Mathematics
Language
eng
Abstract
We explicitly characterize the family of networks for which such a protocol exists. This characterization is given in terms of forbidden rooted minors, which leads to a linear time recognition algorithm for this family of networks. We obtain a similar characterization for the family of networks in which a message can be broadcast from a single node s to all other nodes. Finally, we show that there is a forbidden rooted minor characterization for the more general case when a header (containing routing information) of fixed length is attached to the message, and we discuss the algorithmic consequences of this characterization.
Graduation Semester
2002
Type of Resource
text
Permalink
http://hdl.handle.net/2142/86805

Owning Collections

Graduate Dissertations and Theses at Illinois PRIMARY
Graduate Theses and Dissertations at Illinois
Dissertations and Theses - Mathematics