{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/19190"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/19190","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Graph minors and algorithms","abstract":"A graph H is a minor of another graph G, denoted by $H\\ {\\prec\\sb{m}}\\ G,$ if a graph isomorphic to H can be obtained from G by a series of vertex deletions, edge deletions, and edge contractions. Graph minors have been studied for several decades as a way of characterizing classes of graphs. Recent work by Robertson and Seymour has provided further motivation for studying both mathematical and computational aspects of graph minor theory.","abstract_html":"A graph H is a minor of another graph G, denoted by <span class=\"etd-inline-math\">H {\\prec\\sb{m}} G,</span> if a graph isomorphic to H can be obtained from G by a series of vertex deletions, edge deletions, and edge contractions. Graph minors have been studied for several decades as a way of characterizing classes of graphs. Recent work by Robertson and Seymour has provided further motivation for studying both mathematical and computational aspects of graph minor theory.","abstract_has_math":true,"creators":["McGuinness, Patrick James"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Brown, Donna J."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2011,"date_issued":"2011-05-07T11:59:41Z","date_published":"2011-05-07T11:59:41Z","updated_at":"2026-07-22T22:25:12Z","subjects":["Mathematics","Computer Science"],"languages":["eng"],"rights":["Copyright 1992 McGuinness, Patrick James"],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["AAI9236539","(UMI)AAI9236539"],"render_values":[{"text":"AAI9236539","href":null,"code":true},{"text":"(UMI)AAI9236539","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/19190","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Brown, Donna J."]},{"key":"dc:creator","label":"Author","values":["McGuinness, Patrick James"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2011-05-07T11:59:41Z","10000-01-01","1992"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Mathematics","Computer Science"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 1992 McGuinness, Patrick James"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["AAI9236539","(UMI)AAI9236539","http://hdl.handle.net/2142/19190"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["A graph H is a minor of another graph G, denoted by $H\\ {\\prec\\sb{m}}\\ G,$ if a graph isomorphic to H can be obtained from G by a series of vertex deletions, edge deletions, and edge contractions. Graph minors have been studied for several decades as a way of characterizing classes of graphs. Recent work by Robertson and Seymour has provided further motivation for studying both mathematical and computational aspects of graph minor theory.","This thesis examines some graph-theoretic and algorithmic aspects of graph minors. We examine connectivity, minimum degree, and related minor-ordered functions. In particular, we study the sets of minor-minimal graphs for minimum degree and connectivity 4, 5, and 6, and present several classes of graphs that are minor-minimal for connectivity and minimum degree k, for general values of k. We present sequential and parallel algorithms to test for a $K\\sb5$ minor. In the process of describing these algorithms, we prove structural results concerning graphs that do not contain a $K\\sb5$ minor. Our $O(n\\sp2)$ sequential algorithm tests for the existence of a $K\\sb5$ minor in a graph and, if a $K\\sb5$ minor exists, returns the branch sets of a $K\\sb5$ minor. Our parallel algorithm to find a $K\\sb5$ minor in a graph requires $O(\\log\\sp2 n)$ time and $O(n\\sp3\\alpha(n, n)/\\log\\ n)$ processors. Following up on our $K\\sb5$ minor algorithm, we examine classes of graphs that do not contain a $K\\sb6$ minor. Finally, we examine pathwidth, a minor-ordered function that plays an important role in the work of Robertson and Seymour. We show bounds relating pathwidth, cutwidth and treewidth, and we present a characterization of graphs with pathwidth k, for any value of k.","Made available in DSpace on 2011-05-07T11:59:41Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9236539.pdf: 5436075 bytes, checksum: 5d09e62d283cd63f056eba6b089fac4c (MD5) Previous issue date: 1992","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T14:35:16Z Item is restricted indefinitely.","Restriction data tranferred 2014-07-01T11:13:50-05:00 Original Data Group with Access UIUC Users [automated] Release Date: none Reason: ETDs are only available to UIUC Users without author permission","ETDs are only available to UIUC Users without author permission","U of I Only"]},{"key":"dc:title","label":"Title","values":["Graph minors and algorithms"]}]}],"canonical_facts":{"dc:contributor":["Brown, Donna J."],"dc:creator":["McGuinness, Patrick James"],"dc:date":["2011-05-07T11:59:41Z","10000-01-01","1992"],"dc:description":["A graph H is a minor of another graph G, denoted by $H\\ {\\prec\\sb{m}}\\ G,$ if a graph isomorphic to H can be obtained from G by a series of vertex deletions, edge deletions, and edge contractions. Graph minors have been studied for several decades as a way of characterizing classes of graphs. Recent work by Robertson and Seymour has provided further motivation for studying both mathematical and computational aspects of graph minor theory.","This thesis examines some graph-theoretic and algorithmic aspects of graph minors. We examine connectivity, minimum degree, and related minor-ordered functions. In particular, we study the sets of minor-minimal graphs for minimum degree and connectivity 4, 5, and 6, and present several classes of graphs that are minor-minimal for connectivity and minimum degree k, for general values of k. We present sequential and parallel algorithms to test for a $K\\sb5$ minor. In the process of describing these algorithms, we prove structural results concerning graphs that do not contain a $K\\sb5$ minor. Our $O(n\\sp2)$ sequential algorithm tests for the existence of a $K\\sb5$ minor in a graph and, if a $K\\sb5$ minor exists, returns the branch sets of a $K\\sb5$ minor. Our parallel algorithm to find a $K\\sb5$ minor in a graph requires $O(\\log\\sp2 n)$ time and $O(n\\sp3\\alpha(n, n)/\\log\\ n)$ processors. Following up on our $K\\sb5$ minor algorithm, we examine classes of graphs that do not contain a $K\\sb6$ minor. Finally, we examine pathwidth, a minor-ordered function that plays an important role in the work of Robertson and Seymour. We show bounds relating pathwidth, cutwidth and treewidth, and we present a characterization of graphs with pathwidth k, for any value of k.","Made available in DSpace on 2011-05-07T11:59:41Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9236539.pdf: 5436075 bytes, checksum: 5d09e62d283cd63f056eba6b089fac4c (MD5) Previous issue date: 1992","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T14:35:16Z Item is restricted indefinitely.","Restriction data tranferred 2014-07-01T11:13:50-05:00 Original Data Group with Access UIUC Users [automated] Release Date: none Reason: ETDs are only available to UIUC Users without author permission","ETDs are only available to UIUC Users without author permission","U of I Only"],"dc:identifier":["AAI9236539","(UMI)AAI9236539","http://hdl.handle.net/2142/19190"],"dc:language":["eng"],"dc:rights":["Copyright 1992 McGuinness, Patrick James"],"dc:subject":["Mathematics","Computer Science"],"dc:title":["Graph minors and algorithms"],"dc:type":["text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:12Z"}