The isomorphism problem for directed path graphs and for rooted directed path graphs:
Gespeichert in:
| Beteiligte Personen: | , , |
|---|---|
| Format: | Buch |
| Sprache: | Deutsch |
| Veröffentlicht: |
München
1994
|
| Schriftenreihe: | Technische Universität <München>: TUM-MATH
9401 |
| Schlagwörter: | |
| Abstract: | Abstract: "This paper deals with the isomorphism problem of directed path graphs and rooted directed path graphs. Both graph classes belong to the class of chordal graphs, and for both classes the relative complexity of the isomorphism problem is yet unknown. We prove that deciding isomorphism of directed path graphs is isomorphism complete, whereas in the case of rooted directed path graphs we present a polynomial- time isomorphism algorithm." |
| Umfang: | 20 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010196124 | ||
| 003 | DE-604 | ||
| 005 | 20040413 | ||
| 007 | t| | ||
| 008 | 950515s1994 gw d||| t||| 00||| ger d | ||
| 016 | 7 | |a 944142001 |2 DE-101 | |
| 035 | |a (OCoLC)34870149 | ||
| 035 | |a (DE-599)BVBBV010196124 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a ger | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-12 |a DE-91G | ||
| 088 | |a TUM M 9401 | ||
| 100 | 1 | |a Babel, Luitpold |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a The isomorphism problem for directed path graphs and for rooted directed path graphs |c L. Babel ; I. N. Ponomarenko ; Gottfried Tinhofer |
| 264 | 1 | |a München |c 1994 | |
| 300 | |a 20 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Technische Universität <München>: TUM-MATH |v 9401 | |
| 520 | 3 | |a Abstract: "This paper deals with the isomorphism problem of directed path graphs and rooted directed path graphs. Both graph classes belong to the class of chordal graphs, and for both classes the relative complexity of the isomorphism problem is yet unknown. We prove that deciding isomorphism of directed path graphs is isomorphism complete, whereas in the case of rooted directed path graphs we present a polynomial- time isomorphism algorithm." | |
| 650 | 4 | |a Directed graphs | |
| 650 | 4 | |a Graph theory | |
| 650 | 4 | |a Isomorphisms (Mathematics) | |
| 700 | 1 | |a Ponomarenko, Ilʹja N. |e Verfasser |4 aut | |
| 700 | 1 | |a Tinhofer, Gottfried |e Verfasser |4 aut | |
| 830 | 0 | |a Technische Universität <München>: TUM-MATH |v 9401 |w (DE-604)BV006186461 |9 9401 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-006775126 | |
Datensatz im Suchindex
| DE-BY-TUM_call_number | 0111 2001 B 6081-1994,1 |
|---|---|
| DE-BY-TUM_katkey | 1459117 |
| DE-BY-TUM_location | 01 |
| DE-BY-TUM_media_number | 040010371881 |
| _version_ | 1821932861244047360 |
| any_adam_object | |
| author | Babel, Luitpold Ponomarenko, Ilʹja N. Tinhofer, Gottfried |
| author_facet | Babel, Luitpold Ponomarenko, Ilʹja N. Tinhofer, Gottfried |
| author_role | aut aut aut |
| author_sort | Babel, Luitpold |
| author_variant | l b lb i n p in inp g t gt |
| building | Verbundindex |
| bvnumber | BV010196124 |
| ctrlnum | (OCoLC)34870149 (DE-599)BVBBV010196124 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01659nam a2200373 cb4500</leader><controlfield tag="001">BV010196124</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040413 </controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">950515s1994 gw d||| t||| 00||| ger d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">944142001</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)34870149</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010196124</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">ger</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-91G</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">TUM M 9401</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Babel, Luitpold</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The isomorphism problem for directed path graphs and for rooted directed path graphs</subfield><subfield code="c">L. Babel ; I. N. Ponomarenko ; Gottfried Tinhofer</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">München</subfield><subfield code="c">1994</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">20 S.</subfield><subfield code="b">graph. Darst.</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">Technische Universität <München>: TUM-MATH</subfield><subfield code="v">9401</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This paper deals with the isomorphism problem of directed path graphs and rooted directed path graphs. Both graph classes belong to the class of chordal graphs, and for both classes the relative complexity of the isomorphism problem is yet unknown. We prove that deciding isomorphism of directed path graphs is isomorphism complete, whereas in the case of rooted directed path graphs we present a polynomial- time isomorphism algorithm."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Directed graphs</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Isomorphisms (Mathematics)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ponomarenko, Ilʹja N.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Tinhofer, Gottfried</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Technische Universität <München>: TUM-MATH</subfield><subfield code="v">9401</subfield><subfield code="w">(DE-604)BV006186461</subfield><subfield code="9">9401</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006775126</subfield></datafield></record></collection> |
| id | DE-604.BV010196124 |
| illustrated | Illustrated |
| indexdate | 2024-12-20T09:49:45Z |
| institution | BVB |
| language | German |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006775126 |
| oclc_num | 34870149 |
| open_access_boolean | |
| owner | DE-12 DE-91G DE-BY-TUM |
| owner_facet | DE-12 DE-91G DE-BY-TUM |
| physical | 20 S. graph. Darst. |
| publishDate | 1994 |
| publishDateSearch | 1994 |
| publishDateSort | 1994 |
| record_format | marc |
| series | Technische Universität <München>: TUM-MATH |
| series2 | Technische Universität <München>: TUM-MATH |
| spellingShingle | Babel, Luitpold Ponomarenko, Ilʹja N. Tinhofer, Gottfried The isomorphism problem for directed path graphs and for rooted directed path graphs Technische Universität <München>: TUM-MATH Directed graphs Graph theory Isomorphisms (Mathematics) |
| title | The isomorphism problem for directed path graphs and for rooted directed path graphs |
| title_auth | The isomorphism problem for directed path graphs and for rooted directed path graphs |
| title_exact_search | The isomorphism problem for directed path graphs and for rooted directed path graphs |
| title_full | The isomorphism problem for directed path graphs and for rooted directed path graphs L. Babel ; I. N. Ponomarenko ; Gottfried Tinhofer |
| title_fullStr | The isomorphism problem for directed path graphs and for rooted directed path graphs L. Babel ; I. N. Ponomarenko ; Gottfried Tinhofer |
| title_full_unstemmed | The isomorphism problem for directed path graphs and for rooted directed path graphs L. Babel ; I. N. Ponomarenko ; Gottfried Tinhofer |
| title_short | The isomorphism problem for directed path graphs and for rooted directed path graphs |
| title_sort | the isomorphism problem for directed path graphs and for rooted directed path graphs |
| topic | Directed graphs Graph theory Isomorphisms (Mathematics) |
| topic_facet | Directed graphs Graph theory Isomorphisms (Mathematics) |
| volume_link | (DE-604)BV006186461 |
| work_keys_str_mv | AT babelluitpold theisomorphismproblemfordirectedpathgraphsandforrooteddirectedpathgraphs AT ponomarenkoilʹjan theisomorphismproblemfordirectedpathgraphsandforrooteddirectedpathgraphs AT tinhofergottfried theisomorphismproblemfordirectedpathgraphsandforrooteddirectedpathgraphs |
Paper/Kapitel scannen lassen
Teilbibliothek Mathematik & Informatik, Berichte
| Signatur: |
0111 2001 B 6081-1994,1
Lageplan |
|---|---|
| Exemplar 1 | Ausleihbar Am Standort |