Matches in SemOpenAlex for { <https://semopenalex.org/work/W4386303018> ?p ?o ?g. }
Showing items 1 to 57 of
57
with 100 items per page.
- W4386303018 abstract "Graphs are fundamental objects that find widespread applications across computer science and beyond. Graph Theory has yielded deep insights about structural properties of various families of graphs, which are leveraged in the design and analysis of algorithms for graph optimization problems and other computational optimization problems. These insights have also proved helpful in understanding the limits of efficient computation by providing constructions of hard problem instances. At the same time, algorithmic tools and techniques provide a fresh perspective on graph theoretic problems, often leading to novel discoveries. In this thesis, we exploit this symbiotic relationship between graph theory and algorithms for graph optimization problems and beyond. This thesis consists of three parts. In the first part, we study a graph routing problem called the Node-Disjoint Paths (NDP) problem. Given a graph and a set of source-destination pairs of its vertices, the goal is to route the maximum number of pairs via node-disjoint paths. We come close to resolving the approximability of NDP by showing that it is $n^{Omega(1/polyloglog n)}$-hard to approximate, even on grid graphs, where n is the number of vertices. In the second part of this thesis, we use graph decomposition techniques developed for efficient algorithms to derive a graph theoretic result. We show that for every n-vertex expander graph G, if H is any graph with at most $O(n/log n)$ vertices and edges, then H is a minor of G. In the last part, we show that the graph theoretic tools and graph algorithmic techniques can shed light on problems seemingly unrelated to graphs. We show that the randomized space complexity of the Longest Increasing Subsequence (LIS) problem in the streaming model is intrinsically tied to the query-complexity of the Non-Crossing Matching problem on graphs in a new model of computation that we define." @default.
- W4386303018 created "2023-08-31" @default.
- W4386303018 creator A5056916494 @default.
- W4386303018 date "2023-08-29" @default.
- W4386303018 modified "2023-09-27" @default.
- W4386303018 title "Graph Theory and its Uses in Graph Algorithms and Beyond" @default.
- W4386303018 doi "https://doi.org/10.48550/arxiv.2308.15473" @default.
- W4386303018 hasPublicationYear "2023" @default.
- W4386303018 type Work @default.
- W4386303018 citedByCount "0" @default.
- W4386303018 crossrefType "posted-content" @default.
- W4386303018 hasAuthorship W4386303018A5056916494 @default.
- W4386303018 hasBestOaLocation W43863030181 @default.
- W4386303018 hasConcept C11413529 @default.
- W4386303018 hasConcept C114614502 @default.
- W4386303018 hasConcept C118615104 @default.
- W4386303018 hasConcept C132525143 @default.
- W4386303018 hasConcept C168291704 @default.
- W4386303018 hasConcept C17169500 @default.
- W4386303018 hasConcept C18819970 @default.
- W4386303018 hasConcept C19332903 @default.
- W4386303018 hasConcept C203776342 @default.
- W4386303018 hasConcept C22149727 @default.
- W4386303018 hasConcept C33923547 @default.
- W4386303018 hasConcept C41008148 @default.
- W4386303018 hasConcept C45340560 @default.
- W4386303018 hasConcept C80444323 @default.
- W4386303018 hasConceptScore W4386303018C11413529 @default.
- W4386303018 hasConceptScore W4386303018C114614502 @default.
- W4386303018 hasConceptScore W4386303018C118615104 @default.
- W4386303018 hasConceptScore W4386303018C132525143 @default.
- W4386303018 hasConceptScore W4386303018C168291704 @default.
- W4386303018 hasConceptScore W4386303018C17169500 @default.
- W4386303018 hasConceptScore W4386303018C18819970 @default.
- W4386303018 hasConceptScore W4386303018C19332903 @default.
- W4386303018 hasConceptScore W4386303018C203776342 @default.
- W4386303018 hasConceptScore W4386303018C22149727 @default.
- W4386303018 hasConceptScore W4386303018C33923547 @default.
- W4386303018 hasConceptScore W4386303018C41008148 @default.
- W4386303018 hasConceptScore W4386303018C45340560 @default.
- W4386303018 hasConceptScore W4386303018C80444323 @default.
- W4386303018 hasLocation W43863030181 @default.
- W4386303018 hasOpenAccess W4386303018 @default.
- W4386303018 hasPrimaryLocation W43863030181 @default.
- W4386303018 hasRelatedWork W1984128946 @default.
- W4386303018 hasRelatedWork W1999761254 @default.
- W4386303018 hasRelatedWork W2014355235 @default.
- W4386303018 hasRelatedWork W2029951666 @default.
- W4386303018 hasRelatedWork W2059929223 @default.
- W4386303018 hasRelatedWork W2065459306 @default.
- W4386303018 hasRelatedWork W2793949464 @default.
- W4386303018 hasRelatedWork W2900680118 @default.
- W4386303018 hasRelatedWork W3175246409 @default.
- W4386303018 hasRelatedWork W2278094798 @default.
- W4386303018 isParatext "false" @default.
- W4386303018 isRetracted "false" @default.
- W4386303018 workType "article" @default.