Matches in SemOpenAlex for { <https://semopenalex.org/work/W2309739475> ?p ?o ?g. }
Showing items 1 to 51 of
51
with 100 items per page.
- W2309739475 abstract "A graph H is a minor of another graph G, denoted by $H {precsb{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 $Ksb5$ minor. In the process of describing these algorithms, we prove structural results concerning graphs that do not contain a $Ksb5$ minor. Our $O(nsp2)$ sequential algorithm tests for the existence of a $Ksb5$ minor in a graph and, if a $Ksb5$ minor exists, returns the branch sets of a $Ksb5$ minor. Our parallel algorithm to find a $Ksb5$ minor in a graph requires $O(logsp2 n)$ time and $O(nsp3alpha(n, n)/log n)$ processors. Following up on our $Ksb5$ minor algorithm, we examine classes of graphs that do not contain a $Ksb6$ 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." @default.
- W2309739475 created "2016-06-24" @default.
- W2309739475 creator A5000923557 @default.
- W2309739475 date "1992-01-01" @default.
- W2309739475 modified "2023-09-26" @default.
- W2309739475 title "Graph minors and algorithms" @default.
- W2309739475 hasPublicationYear "1992" @default.
- W2309739475 type Work @default.
- W2309739475 sameAs 2309739475 @default.
- W2309739475 citedByCount "0" @default.
- W2309739475 crossrefType "journal-article" @default.
- W2309739475 hasAuthorship W2309739475A5000923557 @default.
- W2309739475 hasConcept C11413529 @default.
- W2309739475 hasConcept C114614502 @default.
- W2309739475 hasConcept C118615104 @default.
- W2309739475 hasConcept C132525143 @default.
- W2309739475 hasConcept C140752511 @default.
- W2309739475 hasConcept C17744445 @default.
- W2309739475 hasConcept C199539241 @default.
- W2309739475 hasConcept C203776342 @default.
- W2309739475 hasConcept C22149727 @default.
- W2309739475 hasConcept C2779760435 @default.
- W2309739475 hasConcept C33923547 @default.
- W2309739475 hasConcept C64339825 @default.
- W2309739475 hasConceptScore W2309739475C11413529 @default.
- W2309739475 hasConceptScore W2309739475C114614502 @default.
- W2309739475 hasConceptScore W2309739475C118615104 @default.
- W2309739475 hasConceptScore W2309739475C132525143 @default.
- W2309739475 hasConceptScore W2309739475C140752511 @default.
- W2309739475 hasConceptScore W2309739475C17744445 @default.
- W2309739475 hasConceptScore W2309739475C199539241 @default.
- W2309739475 hasConceptScore W2309739475C203776342 @default.
- W2309739475 hasConceptScore W2309739475C22149727 @default.
- W2309739475 hasConceptScore W2309739475C2779760435 @default.
- W2309739475 hasConceptScore W2309739475C33923547 @default.
- W2309739475 hasConceptScore W2309739475C64339825 @default.
- W2309739475 hasLocation W23097394751 @default.
- W2309739475 hasOpenAccess W2309739475 @default.
- W2309739475 hasPrimaryLocation W23097394751 @default.
- W2309739475 hasRelatedWork W1523142394 @default.
- W2309739475 hasRelatedWork W2297829453 @default.
- W2309739475 hasRelatedWork W2301308735 @default.
- W2309739475 hasRelatedWork W236816005 @default.
- W2309739475 hasRelatedWork W2419627969 @default.
- W2309739475 hasRelatedWork W653105555 @default.
- W2309739475 hasRelatedWork W2184689876 @default.
- W2309739475 hasRelatedWork W2944729808 @default.
- W2309739475 isParatext "false" @default.
- W2309739475 isRetracted "false" @default.
- W2309739475 magId "2309739475" @default.
- W2309739475 workType "article" @default.