Matches in SemOpenAlex for { <https://semopenalex.org/work/W35535541> ?p ?o ?g. }
Showing items 1 to 80 of
80
with 100 items per page.
- W35535541 abstract "Intersection graphs have often been used to model special structure in graph problems for both practical and theoretical reasons. Often problems can be solved efficiently for a restricted class of graphs that are provably hard for graphs in general. In this thesis, we examine parallel (i.e. NC) algorithms for exploiting the special structure of different types of intersection graphs to solve common graph problems. First, we show how to recognize whether a graph belongs to one of the special families of intersection graphs. Only after this has been done can we take advantage of the properties of a class of intersection graphs.Let $cal F$ be a family of nonempty sets. Then the intersection graph of $cal F$ is obtained by representing each set in $cal F$ by a vertex and connecting two vertices if and only if their corresponding sets have a nonempty intersection. In this dissertation several types of intersection graphs will be examined, among them interval, comparability, chordal, path, and circle graphs. Interval and comparability graphs arise often when solving scheduling problems. Chordal graphs have applications in solving sparse systems of linear equations and in relational database theory.Each of these classes of intersection graphs is closed under a natural graph composition operation, namely one of modular composition, clique identification, and split composition. In this thesis, we show that the number of intersection representations for a graph in one of these classes depends on how the graphs was composed from indecomposable graphs. Also, we show how to efficiently decompose any graph (i.e. perform the inverse of the above composition operations) in parallel. Often if we can solve a problem efficiently on the indecomposable pieces of a graph, then we can solve this same problem efficiently on the graph itself in parallel. Thus we can extend many of our results on special classes of intersection graphs to more general classes of graphs." @default.
- W35535541 created "2016-06-24" @default.
- W35535541 creator A5052966305 @default.
- W35535541 date "1990-01-01" @default.
- W35535541 modified "2023-09-27" @default.
- W35535541 title "Parallel algorithms for intersection graphs" @default.
- W35535541 hasPublicationYear "1990" @default.
- W35535541 type Work @default.
- W35535541 sameAs 35535541 @default.
- W35535541 citedByCount "1" @default.
- W35535541 countsByYear W355355412020 @default.
- W35535541 crossrefType "journal-article" @default.
- W35535541 hasAuthorship W35535541A5052966305 @default.
- W35535541 hasConcept C102192266 @default.
- W35535541 hasConcept C114614502 @default.
- W35535541 hasConcept C118615104 @default.
- W35535541 hasConcept C132525143 @default.
- W35535541 hasConcept C147792647 @default.
- W35535541 hasConcept C149530733 @default.
- W35535541 hasConcept C160446614 @default.
- W35535541 hasConcept C18359143 @default.
- W35535541 hasConcept C186942658 @default.
- W35535541 hasConcept C187407849 @default.
- W35535541 hasConcept C198414033 @default.
- W35535541 hasConcept C203776342 @default.
- W35535541 hasConcept C33923547 @default.
- W35535541 hasConcept C43413943 @default.
- W35535541 hasConcept C43517604 @default.
- W35535541 hasConcept C54540088 @default.
- W35535541 hasConcept C59824394 @default.
- W35535541 hasConcept C67810366 @default.
- W35535541 hasConcept C74133993 @default.
- W35535541 hasConcept C8554925 @default.
- W35535541 hasConceptScore W35535541C102192266 @default.
- W35535541 hasConceptScore W35535541C114614502 @default.
- W35535541 hasConceptScore W35535541C118615104 @default.
- W35535541 hasConceptScore W35535541C132525143 @default.
- W35535541 hasConceptScore W35535541C147792647 @default.
- W35535541 hasConceptScore W35535541C149530733 @default.
- W35535541 hasConceptScore W35535541C160446614 @default.
- W35535541 hasConceptScore W35535541C18359143 @default.
- W35535541 hasConceptScore W35535541C186942658 @default.
- W35535541 hasConceptScore W35535541C187407849 @default.
- W35535541 hasConceptScore W35535541C198414033 @default.
- W35535541 hasConceptScore W35535541C203776342 @default.
- W35535541 hasConceptScore W35535541C33923547 @default.
- W35535541 hasConceptScore W35535541C43413943 @default.
- W35535541 hasConceptScore W35535541C43517604 @default.
- W35535541 hasConceptScore W35535541C54540088 @default.
- W35535541 hasConceptScore W35535541C59824394 @default.
- W35535541 hasConceptScore W35535541C67810366 @default.
- W35535541 hasConceptScore W35535541C74133993 @default.
- W35535541 hasConceptScore W35535541C8554925 @default.
- W35535541 hasLocation W355355411 @default.
- W35535541 hasOpenAccess W35535541 @default.
- W35535541 hasPrimaryLocation W355355411 @default.
- W35535541 hasRelatedWork W110470963 @default.
- W35535541 hasRelatedWork W1506968473 @default.
- W35535541 hasRelatedWork W1560723985 @default.
- W35535541 hasRelatedWork W183274508 @default.
- W35535541 hasRelatedWork W1892973443 @default.
- W35535541 hasRelatedWork W1987721329 @default.
- W35535541 hasRelatedWork W2280002837 @default.
- W35535541 hasRelatedWork W2284574687 @default.
- W35535541 hasRelatedWork W2393632265 @default.
- W35535541 hasRelatedWork W2407321885 @default.
- W35535541 hasRelatedWork W2530575142 @default.
- W35535541 hasRelatedWork W2574893499 @default.
- W35535541 hasRelatedWork W2610574361 @default.
- W35535541 hasRelatedWork W2694242219 @default.
- W35535541 hasRelatedWork W2912875731 @default.
- W35535541 hasRelatedWork W2921066731 @default.
- W35535541 hasRelatedWork W2955841312 @default.
- W35535541 hasRelatedWork W3022162048 @default.
- W35535541 hasRelatedWork W3092339751 @default.
- W35535541 hasRelatedWork W2786472204 @default.
- W35535541 isParatext "false" @default.
- W35535541 isRetracted "false" @default.
- W35535541 magId "35535541" @default.
- W35535541 workType "article" @default.