FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W1480011653> ?p ?o ?g. }

• W1480011653 abstract "This thesis reports an investigation of some divide-and-conquer algorithms on graphs. A graph problem can often be solved by cutting the graph into two or more pieces of roughly equal size, solving the problem on the pieces, and combining the partial results to get a solution to the original problem.We begin by considering the conditions under which a graph can be divided by removing a small set of vertices. Lipton and Tarjan have shown that a planar graph can be split in half by removing a set of vertices whose size is proportional to the square root of the size of the graph; we say that such graphs have square root separators. Other separator theorems are known for trees, hypercubes, and various graphs that have been suggested as interconnection patterns for parallel processors. Most of these separator theorems generalize to graphs with weighted vertices. We show that if a graph and its subgraphs have square root separators, and the vertices have two independent sets of nonnegative weights, then the graph has a square root separator that cuts one kind of weight exactly in half and the other kind in half to within any specified tolerance. We use this result to prove that, in a graph with square root separators and vertices of average weight one, a fragment of any specified weight can be isolated with a separator whose size is proportional to the square root of the fragment's weight.Second, we analyze an algorithm for a combinatorial problem that arises in numerical analysis. A large system of linear equations whose coefficients are nearly all zeroes can be solved by Gaussian elimination, but in the process the zeroes often become nonzero. Nonzeroes must be stored and operated upon explicitly, so it is advantageous to order the computations in a way that creates relatively few nonzeroes. The generalized nested dissection algorithm, due to Lipton, Rose, and Tarjan, efficiently provides a good ordering for systems that can be represented as graphs having square root separators. We analyze a simpler variant of this algorithm, and show that it provides good orderings at least for systems that arise from two-dimensional finite difference and finite element problems. The chapter closes with a preliminary exploration of the interplay between continuous and discrete methods in an algorithm that preserves zeroes and has good numerical behaviour.The detailed analysis of a divide-and-conquer algorithm usually involves solving a recurrence relation. The third chapter of the thesis examines one such recurrence, which relates the difficulty of separating a graph into small pieces to the number of edges that the graph can have. The final chapter describes open problems and possible extensions of the thesis work." @default.
• W1480011653 created "2016-06-24" @default.
• W1480011653 creator A5076736767 @default.
• W1480011653 date "1980-01-01" @default.
• W1480011653 modified "2023-09-24" @default.
• W1480011653 title "Graph separator theorems and sparse Gaussian elimination" @default.
• W1480011653 hasPublicationYear "1980" @default.
• W1480011653 type Work @default.
• W1480011653 sameAs 1480011653 @default.
• W1480011653 citedByCount "8" @default.
• W1480011653 crossrefType "book" @default.
• W1480011653 hasAuthorship W1480011653A5076736767 @default.
• W1480011653 hasConcept C114614502 @default.
• W1480011653 hasConcept C11577676 @default.
• W1480011653 hasConcept C118615104 @default.
• W1480011653 hasConcept C121332964 @default.
• W1480011653 hasConcept C132525143 @default.
• W1480011653 hasConcept C185004128 @default.
• W1480011653 hasConcept C2524010 @default.
• W1480011653 hasConcept C33923547 @default.
• W1480011653 hasConcept C97355855 @default.
• W1480011653 hasConceptScore W1480011653C114614502 @default.
• W1480011653 hasConceptScore W1480011653C11577676 @default.
• W1480011653 hasConceptScore W1480011653C118615104 @default.
• W1480011653 hasConceptScore W1480011653C121332964 @default.
• W1480011653 hasConceptScore W1480011653C132525143 @default.
• W1480011653 hasConceptScore W1480011653C185004128 @default.
• W1480011653 hasConceptScore W1480011653C2524010 @default.
• W1480011653 hasConceptScore W1480011653C33923547 @default.
• W1480011653 hasConceptScore W1480011653C97355855 @default.
• W1480011653 hasLocation W14800116531 @default.
• W1480011653 hasOpenAccess W1480011653 @default.
• W1480011653 hasPrimaryLocation W14800116531 @default.
• W1480011653 hasRelatedWork W1496408413 @default.
• W1480011653 hasRelatedWork W1576667471 @default.
• W1480011653 hasRelatedWork W1634750107 @default.
• W1480011653 hasRelatedWork W1981885118 @default.
• W1480011653 hasRelatedWork W1982180670 @default.
• W1480011653 hasRelatedWork W2012917738 @default.
• W1480011653 hasRelatedWork W2038643780 @default.
• W1480011653 hasRelatedWork W2049164482 @default.
• W1480011653 hasRelatedWork W2073558110 @default.
• W1480011653 hasRelatedWork W2073890622 @default.
• W1480011653 hasRelatedWork W2081449822 @default.
• W1480011653 hasRelatedWork W2086119402 @default.
• W1480011653 hasRelatedWork W2107940287 @default.
• W1480011653 hasRelatedWork W2113679823 @default.
• W1480011653 hasRelatedWork W2114030927 @default.
• W1480011653 hasRelatedWork W2137541800 @default.
• W1480011653 hasRelatedWork W2161247714 @default.
• W1480011653 hasRelatedWork W2740368275 @default.
• W1480011653 hasRelatedWork W3124448908 @default.
• W1480011653 hasRelatedWork W3082664529 @default.
• W1480011653 isParatext "false" @default.
• W1480011653 isRetracted "false" @default.
• W1480011653 magId "1480011653" @default.
• W1480011653 workType "book" @default.