Efficient algorithms for disjoint Steiner trees packing problems in planar graphs:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Abschlussarbeit Buch |
| Sprache: | English |
| Veröffentlicht: |
1994
|
| Schlagworte: | |
| Beschreibung: | 83 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV009871008 | ||
| 003 | DE-604 | ||
| 005 | 19950117 | ||
| 007 | t | ||
| 008 | 941028s1994 d||| m||| 00||| engod | ||
| 016 | 7 | |a 94227279X |2 DE-101 | |
| 035 | |a (OCoLC)257841476 | ||
| 035 | |a (DE-599)BVBBV009871008 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91 |a DE-29T |a DE-83 |a DE-11 |a DE-188 | ||
| 084 | |a MAT 055d |2 stub | ||
| 084 | |a MAT 052d |2 stub | ||
| 100 | 1 | |a Ripphausen-Lipa, Heike |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Efficient algorithms for disjoint Steiner trees packing problems in planar graphs |c vorgelegt von Heike Ripphausen-Lipa |
| 264 | 1 | |c 1994 | |
| 300 | |a 83 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 502 | |a Berlin, Techn. Univ., Diss., 1994 | ||
| 650 | 0 | 7 | |a Steiner-Baum |0 (DE-588)4228498-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Effizienter Algorithmus |0 (DE-588)4125422-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Packungsproblem |0 (DE-588)4173057-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Planarer Graph |0 (DE-588)4174783-5 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Planarer Graph |0 (DE-588)4174783-5 |D s |
| 689 | 0 | 1 | |a Steiner-Baum |0 (DE-588)4228498-3 |D s |
| 689 | 0 | 2 | |a Packungsproblem |0 (DE-588)4173057-4 |D s |
| 689 | 0 | 3 | |a Effizienter Algorithmus |0 (DE-588)4125422-3 |D s |
| 689 | 0 | |5 DE-604 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006537429 | ||
Datensatz im Suchindex
| _version_ | 1804124230235717632 |
|---|---|
| any_adam_object | |
| author | Ripphausen-Lipa, Heike |
| author_facet | Ripphausen-Lipa, Heike |
| author_role | aut |
| author_sort | Ripphausen-Lipa, Heike |
| author_variant | h r l hrl |
| building | Verbundindex |
| bvnumber | BV009871008 |
| classification_tum | MAT 055d MAT 052d |
| ctrlnum | (OCoLC)257841476 (DE-599)BVBBV009871008 |
| discipline | Mathematik |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01459nam a2200409 c 4500</leader><controlfield tag="001">BV009871008</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19950117 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">941028s1994 d||| m||| 00||| engod</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">94227279X</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)257841476</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009871008</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-91</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 055d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 052d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ripphausen-Lipa, Heike</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Efficient algorithms for disjoint Steiner trees packing problems in planar graphs</subfield><subfield code="c">vorgelegt von Heike Ripphausen-Lipa</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1994</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">83 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="502" ind1=" " ind2=" "><subfield code="a">Berlin, Techn. Univ., Diss., 1994</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Steiner-Baum</subfield><subfield code="0">(DE-588)4228498-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Effizienter Algorithmus</subfield><subfield code="0">(DE-588)4125422-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Packungsproblem</subfield><subfield code="0">(DE-588)4173057-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Planarer Graph</subfield><subfield code="0">(DE-588)4174783-5</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="689" ind1="0" ind2="0"><subfield code="a">Planarer Graph</subfield><subfield code="0">(DE-588)4174783-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Steiner-Baum</subfield><subfield code="0">(DE-588)4228498-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Packungsproblem</subfield><subfield code="0">(DE-588)4173057-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Effizienter Algorithmus</subfield><subfield code="0">(DE-588)4125422-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006537429</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV009871008 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T17:42:21Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006537429 |
| oclc_num | 257841476 |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM DE-29T DE-83 DE-11 DE-188 |
| owner_facet | DE-91 DE-BY-TUM DE-29T DE-83 DE-11 DE-188 |
| physical | 83 S. graph. Darst. |
| publishDate | 1994 |
| publishDateSearch | 1994 |
| publishDateSort | 1994 |
| record_format | marc |
| spelling | Ripphausen-Lipa, Heike Verfasser aut Efficient algorithms for disjoint Steiner trees packing problems in planar graphs vorgelegt von Heike Ripphausen-Lipa 1994 83 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Berlin, Techn. Univ., Diss., 1994 Steiner-Baum (DE-588)4228498-3 gnd rswk-swf Effizienter Algorithmus (DE-588)4125422-3 gnd rswk-swf Packungsproblem (DE-588)4173057-4 gnd rswk-swf Planarer Graph (DE-588)4174783-5 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Planarer Graph (DE-588)4174783-5 s Steiner-Baum (DE-588)4228498-3 s Packungsproblem (DE-588)4173057-4 s Effizienter Algorithmus (DE-588)4125422-3 s DE-604 |
| spellingShingle | Ripphausen-Lipa, Heike Efficient algorithms for disjoint Steiner trees packing problems in planar graphs Steiner-Baum (DE-588)4228498-3 gnd Effizienter Algorithmus (DE-588)4125422-3 gnd Packungsproblem (DE-588)4173057-4 gnd Planarer Graph (DE-588)4174783-5 gnd |
| subject_GND | (DE-588)4228498-3 (DE-588)4125422-3 (DE-588)4173057-4 (DE-588)4174783-5 (DE-588)4113937-9 |
| title | Efficient algorithms for disjoint Steiner trees packing problems in planar graphs |
| title_auth | Efficient algorithms for disjoint Steiner trees packing problems in planar graphs |
| title_exact_search | Efficient algorithms for disjoint Steiner trees packing problems in planar graphs |
| title_full | Efficient algorithms for disjoint Steiner trees packing problems in planar graphs vorgelegt von Heike Ripphausen-Lipa |
| title_fullStr | Efficient algorithms for disjoint Steiner trees packing problems in planar graphs vorgelegt von Heike Ripphausen-Lipa |
| title_full_unstemmed | Efficient algorithms for disjoint Steiner trees packing problems in planar graphs vorgelegt von Heike Ripphausen-Lipa |
| title_short | Efficient algorithms for disjoint Steiner trees packing problems in planar graphs |
| title_sort | efficient algorithms for disjoint steiner trees packing problems in planar graphs |
| topic | Steiner-Baum (DE-588)4228498-3 gnd Effizienter Algorithmus (DE-588)4125422-3 gnd Packungsproblem (DE-588)4173057-4 gnd Planarer Graph (DE-588)4174783-5 gnd |
| topic_facet | Steiner-Baum Effizienter Algorithmus Packungsproblem Planarer Graph Hochschulschrift |
| work_keys_str_mv | AT ripphausenlipaheike efficientalgorithmsfordisjointsteinertreespackingproblemsinplanargraphs |