Intersection graph algorithms:
An intersection graph for a set of sets
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Ithaca, NY
1984
|
| Series: | Cornell University <Ithaca, NY> / Dep. of Computer Science: Technical report
628. |
| Subjects: | |
| Summary: | An intersection graph for a set of sets 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 |
| Item Description: | Zugl.: Ithaca, NY, Univ., Diss. |
| Physical Description: | VIII, 135 S. Ill. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV006527892 | ||
| 003 | DE-604 | ||
| 005 | 19970310 | ||
| 007 | t| | ||
| 008 | 930210s1984 xx a||| m||| 00||| eng d | ||
| 035 | |a (OCoLC)13399697 | ||
| 035 | |a (DE-599)BVBBV006527892 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 084 | |a DAT 537d |2 stub | ||
| 100 | 1 | |a Dietz, Paul F. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Intersection graph algorithms |
| 264 | 1 | |a Ithaca, NY |c 1984 | |
| 300 | |a VIII, 135 S. |b Ill. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Cornell University <Ithaca, NY> / Dep. of Computer Science: Technical report |v 628. | |
| 500 | |a Zugl.: Ithaca, NY, Univ., Diss. | ||
| 520 | 3 | |a An intersection graph for a set of sets | |
| 520 | 3 | |a 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 | |
| 520 | 3 | |a 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 | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Graph theory | |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 810 | 2 | |a Dep. of Computer Science: Technical report |t Cornell University <Ithaca, NY> |v 628. |w (DE-604)BV006185504 |9 628 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-004157511 | |
Record in the Search Index
| _version_ | 1820882584476844032 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Dietz, Paul F. |
| author_facet | Dietz, Paul F. |
| author_role | aut |
| author_sort | Dietz, Paul F. |
| author_variant | p f d pf pfd |
| building | Verbundindex |
| bvnumber | BV006527892 |
| classification_rvk | SS 4570 |
| classification_tum | DAT 537d |
| ctrlnum | (OCoLC)13399697 (DE-599)BVBBV006527892 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV006527892</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19970310</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">930210s1984 xx a||| m||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)13399697</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV006527892</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 537d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Dietz, Paul F.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Intersection graph algorithms</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Ithaca, NY</subfield><subfield code="c">1984</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">VIII, 135 S.</subfield><subfield code="b">Ill.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Cornell University <Ithaca, NY> / Dep. of Computer Science: Technical report</subfield><subfield code="v">628.</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Zugl.: Ithaca, NY, Univ., Diss.</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">An intersection graph for a set of sets</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">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</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">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</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph theory</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Dep. of Computer Science: Technical report</subfield><subfield code="t">Cornell University <Ithaca, NY></subfield><subfield code="v">628.</subfield><subfield code="w">(DE-604)BV006185504</subfield><subfield code="9">628</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-004157511</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV006527892 |
| illustrated | Illustrated |
| indexdate | 2025-01-10T17:09:13Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-004157511 |
| oclc_num | 13399697 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | VIII, 135 S. Ill. |
| publishDate | 1984 |
| publishDateSearch | 1984 |
| publishDateSort | 1984 |
| record_format | marc |
| series2 | Cornell University <Ithaca, NY> / Dep. of Computer Science: Technical report |
| spelling | Dietz, Paul F. Verfasser aut Intersection graph algorithms Ithaca, NY 1984 VIII, 135 S. Ill. txt rdacontent n rdamedia nc rdacarrier Cornell University <Ithaca, NY> / Dep. of Computer Science: Technical report 628. Zugl.: Ithaca, NY, Univ., Diss. An intersection graph for a set of sets 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 Algorithms Graph theory (DE-588)4113937-9 Hochschulschrift gnd-content Dep. of Computer Science: Technical report Cornell University <Ithaca, NY> 628. (DE-604)BV006185504 628 |
| spellingShingle | Dietz, Paul F. Intersection graph algorithms Algorithms Graph theory |
| subject_GND | (DE-588)4113937-9 |
| title | Intersection graph algorithms |
| title_auth | Intersection graph algorithms |
| title_exact_search | Intersection graph algorithms |
| title_full | Intersection graph algorithms |
| title_fullStr | Intersection graph algorithms |
| title_full_unstemmed | Intersection graph algorithms |
| title_short | Intersection graph algorithms |
| title_sort | intersection graph algorithms |
| topic | Algorithms Graph theory |
| topic_facet | Algorithms Graph theory Hochschulschrift |
| volume_link | (DE-604)BV006185504 |
| work_keys_str_mv | AT dietzpaulf intersectiongraphalgorithms |