Shortest edge disjoint paths in graphs:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Abschlussarbeit Buch |
| Sprache: | English |
| Veröffentlicht: |
Oldenburg
Fachbereich Informatik, Univ.
1990
|
| Schriftenreihe: | Berichte aus dem Fachbereich Informatik der Universität Oldenburg
90,1 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | 80 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV024783157 | ||
| 003 | DE-604 | ||
| 007 | t| | ||
| 008 | 100417s1990 xx d||| m||| 00||| eng d | ||
| 016 | 7 | |a 900759224 |2 DE-101 | |
| 035 | |a (OCoLC)889151112 | ||
| 035 | |a (DE-599)BVBBV024783157 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-11 | ||
| 100 | 1 | |a Schwill, Andreas |d 1958- |e Verfasser |0 (DE-588)13258834X |4 aut | |
| 245 | 1 | 0 | |a Shortest edge disjoint paths in graphs |c von Andreas Schwill |
| 264 | 1 | |a Oldenburg |b Fachbereich Informatik, Univ. |c 1990 | |
| 300 | |a 80 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Berichte aus dem Fachbereich Informatik der Universität Oldenburg |v 90,1 | |
| 502 | |a Zugl.: Oldenburg, Univ., Diss., 1990 | ||
| 650 | 0 | 7 | |a Graph |0 (DE-588)4021842-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Extremalproblem |0 (DE-588)4439315-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Pfad |g Mathematik |0 (DE-588)4507234-6 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 655 | 7 | |a Kantenweg |2 gnd |9 rswk-swf | |
| 655 | 7 | |a Injektiver Pfad |2 gnd |9 rswk-swf | |
| 655 | 7 | |a Minimaler Pfad |2 gnd |9 rswk-swf | |
| 689 | 0 | 0 | |a Minimaler Pfad |A f |
| 689 | 0 | 1 | |a Graph |0 (DE-588)4021842-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Injektiver Pfad |A f |
| 689 | 1 | 1 | |a Graph |0 (DE-588)4021842-9 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Graph |0 (DE-588)4021842-9 |D s |
| 689 | 2 | 1 | |a Pfad |g Mathematik |0 (DE-588)4507234-6 |D s |
| 689 | 2 | 2 | |a Extremalproblem |0 (DE-588)4439315-5 |D s |
| 689 | 2 | |5 DE-604 | |
| 689 | 3 | 0 | |a Graph |0 (DE-588)4021842-9 |D s |
| 689 | 3 | 1 | |a Kantenweg |A f |
| 689 | 3 | |5 DE-604 | |
| 810 | 2 | |a Universität <Oldenburg> |p Fachbereich Informatik |t Berichte aus dem Fachbereich Informatik der Universität Oldenburg |v 90,1 |w (DE-604)BV000900143 |9 90,1 | |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=019465414&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-019465414 | |
Datensatz im Suchindex
| _version_ | 1820868378649165824 |
|---|---|
| adam_text |
CONTENTS
1 INTRODUCTION 1
2 PRELIMINARIES 5
3 NECESSARY AND SUFFICIENT CONDITIONS 8
4 COMPLEXITY RESULTS 26
5 EFFICIENT ALGORITHMS 35
5.1 ALGORITHMS FOR GEODETICALLY CONNECTED GRAPHS 35
5.2 A TWO PATHS ALGORITHM FOR CHORDAL GRAPHS 48
6 NONBLOCKING GRAPHS 64
7 CONCLUSIONS 75
8 REFERENCES 78
BIBLIOGRAFISCHE INFORMATIONEN
HTTP://D-NB.INFO/900759224 |
| any_adam_object | 1 |
| author | Schwill, Andreas 1958- |
| author_GND | (DE-588)13258834X |
| author_facet | Schwill, Andreas 1958- |
| author_role | aut |
| author_sort | Schwill, Andreas 1958- |
| author_variant | a s as |
| building | Verbundindex |
| bvnumber | BV024783157 |
| classification_rvk | SS 5560 |
| ctrlnum | (OCoLC)889151112 (DE-599)BVBBV024783157 |
| discipline | Informatik |
| format | Thesis 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">BV024783157</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">100417s1990 xx d||| m||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">900759224</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)889151112</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV024783157</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">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-11</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Schwill, Andreas</subfield><subfield code="d">1958-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)13258834X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Shortest edge disjoint paths in graphs</subfield><subfield code="c">von Andreas Schwill</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Oldenburg</subfield><subfield code="b">Fachbereich Informatik, Univ.</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">80 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">Berichte aus dem Fachbereich Informatik der Universität Oldenburg</subfield><subfield code="v">90,1</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="a">Zugl.: Oldenburg, Univ., Diss., 1990</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Extremalproblem</subfield><subfield code="0">(DE-588)4439315-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Pfad</subfield><subfield code="g">Mathematik</subfield><subfield code="0">(DE-588)4507234-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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="655" ind1=" " ind2="7"><subfield code="a">Kantenweg</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="a">Injektiver Pfad</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="a">Minimaler Pfad</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Minimaler Pfad</subfield><subfield code="A">f</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Injektiver Pfad</subfield><subfield code="A">f</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="1"><subfield code="a">Pfad</subfield><subfield code="g">Mathematik</subfield><subfield code="0">(DE-588)4507234-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="2"><subfield code="a">Extremalproblem</subfield><subfield code="0">(DE-588)4439315-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" ind2="0"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2="1"><subfield code="a">Kantenweg</subfield><subfield code="A">f</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Universität <Oldenburg></subfield><subfield code="p">Fachbereich Informatik</subfield><subfield code="t">Berichte aus dem Fachbereich Informatik der Universität Oldenburg</subfield><subfield code="v">90,1</subfield><subfield code="w">(DE-604)BV000900143</subfield><subfield code="9">90,1</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=019465414&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-019465414</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content Kantenweg gnd Injektiver Pfad gnd Minimaler Pfad gnd |
| genre_facet | Hochschulschrift Kantenweg Injektiver Pfad Minimaler Pfad |
| id | DE-604.BV024783157 |
| illustrated | Illustrated |
| indexdate | 2025-01-10T13:23:25Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-019465414 |
| oclc_num | 889151112 |
| open_access_boolean | |
| owner | DE-11 |
| owner_facet | DE-11 |
| physical | 80 S. graph. Darst. |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| publisher | Fachbereich Informatik, Univ. |
| record_format | marc |
| series2 | Berichte aus dem Fachbereich Informatik der Universität Oldenburg |
| spelling | Schwill, Andreas 1958- Verfasser (DE-588)13258834X aut Shortest edge disjoint paths in graphs von Andreas Schwill Oldenburg Fachbereich Informatik, Univ. 1990 80 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Berichte aus dem Fachbereich Informatik der Universität Oldenburg 90,1 Zugl.: Oldenburg, Univ., Diss., 1990 Graph (DE-588)4021842-9 gnd rswk-swf Extremalproblem (DE-588)4439315-5 gnd rswk-swf Pfad Mathematik (DE-588)4507234-6 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Kantenweg gnd rswk-swf Injektiver Pfad gnd rswk-swf Minimaler Pfad gnd rswk-swf Minimaler Pfad f Graph (DE-588)4021842-9 s DE-604 Injektiver Pfad f Pfad Mathematik (DE-588)4507234-6 s Extremalproblem (DE-588)4439315-5 s Kantenweg f Universität <Oldenburg> Fachbereich Informatik Berichte aus dem Fachbereich Informatik der Universität Oldenburg 90,1 (DE-604)BV000900143 90,1 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=019465414&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Schwill, Andreas 1958- Shortest edge disjoint paths in graphs Graph (DE-588)4021842-9 gnd Extremalproblem (DE-588)4439315-5 gnd Pfad Mathematik (DE-588)4507234-6 gnd |
| subject_GND | (DE-588)4021842-9 (DE-588)4439315-5 (DE-588)4507234-6 (DE-588)4113937-9 |
| title | Shortest edge disjoint paths in graphs |
| title_auth | Shortest edge disjoint paths in graphs |
| title_exact_search | Shortest edge disjoint paths in graphs |
| title_full | Shortest edge disjoint paths in graphs von Andreas Schwill |
| title_fullStr | Shortest edge disjoint paths in graphs von Andreas Schwill |
| title_full_unstemmed | Shortest edge disjoint paths in graphs von Andreas Schwill |
| title_short | Shortest edge disjoint paths in graphs |
| title_sort | shortest edge disjoint paths in graphs |
| topic | Graph (DE-588)4021842-9 gnd Extremalproblem (DE-588)4439315-5 gnd Pfad Mathematik (DE-588)4507234-6 gnd |
| topic_facet | Graph Extremalproblem Pfad Mathematik Hochschulschrift Kantenweg Injektiver Pfad Minimaler Pfad |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=019465414&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV000900143 |
| work_keys_str_mv | AT schwillandreas shortestedgedisjointpathsingraphs |