skip to content
Intersection Graph Algorithms Preview this item
ClosePreview this item
Checking...

Intersection Graph Algorithms

Author: Paul Frederick Dietz
Publisher: Ithaca, N.Y. : Cornell University, 1984.
Dissertation: Ph. D. Cornell University 1984.
Series: Cornell University, Department of Computer Science, TR 84-628.
Edition/Format:   Thesis/dissertation : Thesis/dissertation : EnglishView all editions and formats
Database:WorldCat
Summary:
An intersection graph for a set of sets $C$ is a graph $G$ together with a bijection from the vertices of $G$ to $C$ such that distinct vertices in $G$ are adjacent if and only if their images under this bijection intersect. Of particular interest have been the classes of chordal graphs, the intersection graphs of sets of subtrees of a tree, and interval graphs, the intersection graphs of sets of intervals of the
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Additional Physical Format: Online version:
Dietz, Paul Frederick, 1959-
Intersection Graph Algorithms.
Ithaca, N.Y. : Cornell University, 1984
(OCoLC)704420872
Material Type: Thesis/dissertation
Document Type: Book
All Authors / Contributors: Paul Frederick Dietz
OCLC Number: 13399697
Description: viii, 134 pages : illustrations ; 28 cm.
Series Title: Cornell University, Department of Computer Science, TR 84-628.
Responsibility: Paul F. Dietz.

Abstract:

An intersection graph for a set of sets $C$ is a graph $G$ together with a bijection from the vertices of $G$ to $C$ such that distinct vertices in $G$ are adjacent if and only if their images under this bijection intersect. Of particular interest have been the classes of chordal graphs, the intersection graphs of sets of subtrees of a tree, and interval graphs, the intersection graphs of sets of intervals of the real line.

I examine another class of intersection graphs, the class of directed path graphs: intersection graphs of sets of paths in a directed tree. This class properly contains the class of interval graphs, and is properly contained by the class of chordal graphs. I give a linear time algorithm for recognizing directed path graphs and for constructing intersection representations, and a polynomial time algorithm for deciding directed path graph isomorphism.

Both algorithms use a data structure called a partial path tree, which is a kind of skeletal representation of the clique hypergraph of a directed path graph. I present linear time algorithms for finding partial path trees with specific roots and for finding partial path trees with arbitrary roots. I prove that partial path trees with identical roots are identical. Using this fact I develop a polynomial time algorithm for directed path graph isomorphism.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Related Subjects:(2)

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/13399697>
library:oclcnum"13399697"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/13399697>
rdf:typeschema:Book
rdf:typej.2:Thesis
schema:about
schema:about
schema:about
schema:about
schema:creator
schema:datePublished"1984"
schema:description"I examine another class of intersection graphs, the class of directed path graphs: intersection graphs of sets of paths in a directed tree. This class properly contains the class of interval graphs, and is properly contained by the class of chordal graphs. I give a linear time algorithm for recognizing directed path graphs and for constructing intersection representations, and a polynomial time algorithm for deciding directed path graph isomorphism."@en
schema:description"Both algorithms use a data structure called a partial path tree, which is a kind of skeletal representation of the clique hypergraph of a directed path graph. I present linear time algorithms for finding partial path trees with specific roots and for finding partial path trees with arbitrary roots. I prove that partial path trees with identical roots are identical. Using this fact I develop a polynomial time algorithm for directed path graph isomorphism."@en
schema:description"An intersection graph for a set of sets $C$ is a graph $G$ together with a bijection from the vertices of $G$ to $C$ such that distinct vertices in $G$ are adjacent if and only if their images under this bijection intersect. Of particular interest have been the classes of chordal graphs, the intersection graphs of sets of subtrees of a tree, and interval graphs, the intersection graphs of sets of intervals of the real line."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/7923651>
schema:inLanguage"en"
schema:name"Intersection Graph Algorithms"@en
schema:publisher
schema:url

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.