Linear time algorithm for minimum weight Steiner tree in graphs with bounded tree-width:
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | Undetermined |
| Veröffentlicht: |
Haifa, Israel
1990
|
| Schriftenreihe: | haṭ- Ṭeḵniyyôn, Māḵôn Ṭeḵnôlôgî le-Yiśrā'ēl <Ḥêfā> / Department of Computer Science: Technical report
632 |
| Beschreibung: | 8 Bl. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010525570 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 951213s1990 |||| 00||| undod | ||
| 035 | |a (OCoLC)633489270 | ||
| 035 | |a (DE-599)BVBBV010525570 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | |a und | ||
| 049 | |a DE-91G | ||
| 100 | 1 | |a Korach, Ephraim |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Linear time algorithm for minimum weight Steiner tree in graphs with bounded tree-width |c by Ephraim Korach and Nir Solel |
| 264 | 1 | |a Haifa, Israel |c 1990 | |
| 300 | |a 8 Bl. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a haṭ- Ṭeḵniyyôn, Māḵôn Ṭeḵnôlôgî le-Yiśrā'ēl <Ḥêfā> / Department of Computer Science: Technical report |v 632 | |
| 700 | 1 | |a Solel, Nir |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Technical report |t <<haṭ->> Ṭeḵniyyôn, Māḵôn Ṭeḵnôlôgî le-Yiśrā'ēl <Ḥêfā> |v 632 |w (DE-604)BV010499135 |9 632 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007015133 | ||
Datensatz im Suchindex
| _version_ | 1804124992388988928 |
|---|---|
| any_adam_object | |
| author | Korach, Ephraim Solel, Nir |
| author_facet | Korach, Ephraim Solel, Nir |
| author_role | aut aut |
| author_sort | Korach, Ephraim |
| author_variant | e k ek n s ns |
| building | Verbundindex |
| bvnumber | BV010525570 |
| ctrlnum | (OCoLC)633489270 (DE-599)BVBBV010525570 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01075nam a2200277 cb4500</leader><controlfield tag="001">BV010525570</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">951213s1990 |||| 00||| undod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)633489270</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010525570</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=" " ind2=" "><subfield code="a">und</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Korach, Ephraim</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Linear time algorithm for minimum weight Steiner tree in graphs with bounded tree-width</subfield><subfield code="c">by Ephraim Korach and Nir Solel</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Haifa, Israel</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">8 Bl.</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">haṭ- Ṭeḵniyyôn, Māḵôn Ṭeḵnôlôgî le-Yiśrā'ēl <Ḥêfā> / Department of Computer Science: Technical report</subfield><subfield code="v">632</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Solel, Nir</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Technical report</subfield><subfield code="t"><<haṭ->> Ṭeḵniyyôn, Māḵôn Ṭeḵnôlôgî le-Yiśrā'ēl <Ḥêfā></subfield><subfield code="v">632</subfield><subfield code="w">(DE-604)BV010499135</subfield><subfield code="9">632</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007015133</subfield></datafield></record></collection> |
| id | DE-604.BV010525570 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:54:28Z |
| institution | BVB |
| language | Undetermined |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007015133 |
| oclc_num | 633489270 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 8 Bl. |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| record_format | marc |
| series2 | haṭ- Ṭeḵniyyôn, Māḵôn Ṭeḵnôlôgî le-Yiśrā'ēl <Ḥêfā> / Department of Computer Science: Technical report |
| spelling | Korach, Ephraim Verfasser aut Linear time algorithm for minimum weight Steiner tree in graphs with bounded tree-width by Ephraim Korach and Nir Solel Haifa, Israel 1990 8 Bl. txt rdacontent n rdamedia nc rdacarrier haṭ- Ṭeḵniyyôn, Māḵôn Ṭeḵnôlôgî le-Yiśrā'ēl <Ḥêfā> / Department of Computer Science: Technical report 632 Solel, Nir Verfasser aut Department of Computer Science: Technical report <<haṭ->> Ṭeḵniyyôn, Māḵôn Ṭeḵnôlôgî le-Yiśrā'ēl <Ḥêfā> 632 (DE-604)BV010499135 632 |
| spellingShingle | Korach, Ephraim Solel, Nir Linear time algorithm for minimum weight Steiner tree in graphs with bounded tree-width |
| title | Linear time algorithm for minimum weight Steiner tree in graphs with bounded tree-width |
| title_auth | Linear time algorithm for minimum weight Steiner tree in graphs with bounded tree-width |
| title_exact_search | Linear time algorithm for minimum weight Steiner tree in graphs with bounded tree-width |
| title_full | Linear time algorithm for minimum weight Steiner tree in graphs with bounded tree-width by Ephraim Korach and Nir Solel |
| title_fullStr | Linear time algorithm for minimum weight Steiner tree in graphs with bounded tree-width by Ephraim Korach and Nir Solel |
| title_full_unstemmed | Linear time algorithm for minimum weight Steiner tree in graphs with bounded tree-width by Ephraim Korach and Nir Solel |
| title_short | Linear time algorithm for minimum weight Steiner tree in graphs with bounded tree-width |
| title_sort | linear time algorithm for minimum weight steiner tree in graphs with bounded tree width |
| volume_link | (DE-604)BV010499135 |
| work_keys_str_mv | AT korachephraim lineartimealgorithmforminimumweightsteinertreeingraphswithboundedtreewidth AT solelnir lineartimealgorithmforminimumweightsteinertreeingraphswithboundedtreewidth |