Matches in SemOpenAlex for { <https://semopenalex.org/work/W2912982016> ?p ?o ?g. }
Showing items 1 to 69 of
69
with 100 items per page.
- W2912982016 abstract "From a circle with chords we may derive a graph whose nodes correspond to chords and whose edges correspond to intersecting chords. Such a graph is called a circle graph. After numbering the endpoints of the chords such that two endpoints are numbered the same iff the endpoints belong to the same chord, we form a circle graph sequence by reading off these numbers going around the outside of the circle. Circle graph sequences are often used to prove properties of circle graphs.In this dissertation we discuss many mathematical and algorithmic aspects of circle graphs. The number of different circle with chords representations that yield a chordless path is given. The property that a circle with chords is connected (that is, its derived circle graph is connected) and the property that a circle with chords has two separated chords (that is, two chords that cannot both be intersected by a third chord without the third intersecting a fourth chord) are described in terms of circle graph sequences. They are found to be dual to one another. An incomplete forbidden subgraph characterization of circle graphs is also presented.An important result of this dissertation is that the Berge Strong Perfect Graph Conjecture is shown to hold for the class of circle graphs. Many properties of p-critical graphs and partitionable graphs are given, most with simplified proofs. Some new results are presented and a new, very simple proof of the Berge Conjecture for K(,1,3)-free graphs is put forward.Very efficient algorithms for finding maximum (weighted) cliques and maximum (weighted) stable sets of the derived circle graph of a circle graph sequence are given. We find an O(e*log(,2)(omega)) algorithm for the unweighted clique problem, an O((delta)e) algorithm for the weighted clique problem and an O(c) algorithm for the weighted stable set problem; where e is the number of edges in the graph, the maximum clique size, (delta) the maximum degree and c the number of occurrences of an interval being completely contained in another interval in the circle graph sequence.Some open problems for further research are listed." @default.
- W2912982016 created "2019-02-21" @default.
- W2912982016 creator A5048330781 @default.
- W2912982016 date "2011-08-16" @default.
- W2912982016 modified "2023-10-12" @default.
- W2912982016 title "Circle Graphs" @default.
- W2912982016 hasPublicationYear "2011" @default.
- W2912982016 type Work @default.
- W2912982016 sameAs 2912982016 @default.
- W2912982016 citedByCount "11" @default.
- W2912982016 crossrefType "book" @default.
- W2912982016 hasAuthorship W2912982016A5048330781 @default.
- W2912982016 hasConcept C108710211 @default.
- W2912982016 hasConcept C114614502 @default.
- W2912982016 hasConcept C118615104 @default.
- W2912982016 hasConcept C132525143 @default.
- W2912982016 hasConcept C147792647 @default.
- W2912982016 hasConcept C148189969 @default.
- W2912982016 hasConcept C171528893 @default.
- W2912982016 hasConcept C203776342 @default.
- W2912982016 hasConcept C22149727 @default.
- W2912982016 hasConcept C2524010 @default.
- W2912982016 hasConcept C33923547 @default.
- W2912982016 hasConcept C43413943 @default.
- W2912982016 hasConcept C43517604 @default.
- W2912982016 hasConcept C59824394 @default.
- W2912982016 hasConcept C68103157 @default.
- W2912982016 hasConceptScore W2912982016C108710211 @default.
- W2912982016 hasConceptScore W2912982016C114614502 @default.
- W2912982016 hasConceptScore W2912982016C118615104 @default.
- W2912982016 hasConceptScore W2912982016C132525143 @default.
- W2912982016 hasConceptScore W2912982016C147792647 @default.
- W2912982016 hasConceptScore W2912982016C148189969 @default.
- W2912982016 hasConceptScore W2912982016C171528893 @default.
- W2912982016 hasConceptScore W2912982016C203776342 @default.
- W2912982016 hasConceptScore W2912982016C22149727 @default.
- W2912982016 hasConceptScore W2912982016C2524010 @default.
- W2912982016 hasConceptScore W2912982016C33923547 @default.
- W2912982016 hasConceptScore W2912982016C43413943 @default.
- W2912982016 hasConceptScore W2912982016C43517604 @default.
- W2912982016 hasConceptScore W2912982016C59824394 @default.
- W2912982016 hasConceptScore W2912982016C68103157 @default.
- W2912982016 hasLocation W29129820161 @default.
- W2912982016 hasOpenAccess W2912982016 @default.
- W2912982016 hasPrimaryLocation W29129820161 @default.
- W2912982016 hasRelatedWork W1558167226 @default.
- W2912982016 hasRelatedWork W1973075254 @default.
- W2912982016 hasRelatedWork W2000180600 @default.
- W2912982016 hasRelatedWork W2002300035 @default.
- W2912982016 hasRelatedWork W2015381896 @default.
- W2912982016 hasRelatedWork W2038711832 @default.
- W2912982016 hasRelatedWork W2052850644 @default.
- W2912982016 hasRelatedWork W2140411614 @default.
- W2912982016 hasRelatedWork W2143474538 @default.
- W2912982016 hasRelatedWork W2168918166 @default.
- W2912982016 hasRelatedWork W2172023833 @default.
- W2912982016 hasRelatedWork W2257168763 @default.
- W2912982016 hasRelatedWork W2276314401 @default.
- W2912982016 hasRelatedWork W2584881854 @default.
- W2912982016 hasRelatedWork W2952803432 @default.
- W2912982016 hasRelatedWork W2966094451 @default.
- W2912982016 hasRelatedWork W3021364183 @default.
- W2912982016 hasRelatedWork W45625111 @default.
- W2912982016 hasRelatedWork W2117608641 @default.
- W2912982016 hasRelatedWork W2120639971 @default.
- W2912982016 isParatext "false" @default.
- W2912982016 isRetracted "false" @default.
- W2912982016 magId "2912982016" @default.
- W2912982016 workType "book" @default.