Finding a minimal transitive reduction in a strongly connected digraph within linear time:
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Zürich
1989
|
| Series: | Technische Hochschule <Zürich> / Departement Informatik: Gelbe Berichte des Departements Informatik
103 |
| Physical Description: | 24 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009245908 | ||
| 003 | DE-604 | ||
| 005 | 20180321 | ||
| 007 | t| | ||
| 008 | 940313s1989 xx |||| 00||| eng d | ||
| 035 | |a (OCoLC)46110127 | ||
| 035 | |a (DE-599)BVBBV009245908 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T |a DE-91G |a DE-11 | ||
| 100 | 1 | |a Simon, Klaus |d 1958- |e Verfasser |0 (DE-588)140611193 |4 aut | |
| 245 | 1 | 0 | |a Finding a minimal transitive reduction in a strongly connected digraph within linear time |
| 264 | 1 | |a Zürich |c 1989 | |
| 300 | |a 24 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Technische Hochschule <Zürich> / Departement Informatik: Gelbe Berichte des Departements Informatik |v 103 | |
| 810 | 2 | |a Departement Informatik: Gelbe Berichte des Departements Informatik |t Technische Hochschule <Zürich> |v 103 |w (DE-604)BV009852642 |9 103 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-006152250 | |
Record in the Search Index
| DE-BY-TUM_call_number | 0111 2001 B 6138-103 |
|---|---|
| DE-BY-TUM_katkey | 771561 |
| DE-BY-TUM_location | 01 |
| DE-BY-TUM_media_number | 040010180573 |
| _version_ | 1821938590532239360 |
| any_adam_object | |
| author | Simon, Klaus 1958- |
| author_GND | (DE-588)140611193 |
| author_facet | Simon, Klaus 1958- |
| author_role | aut |
| author_sort | Simon, Klaus 1958- |
| author_variant | k s ks |
| building | Verbundindex |
| bvnumber | BV009245908 |
| ctrlnum | (OCoLC)46110127 (DE-599)BVBBV009245908 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00973nam a2200265 cb4500</leader><controlfield tag="001">BV009245908</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20180321 </controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">940313s1989 xx |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)46110127</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009245908</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-29T</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-11</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Simon, Klaus</subfield><subfield code="d">1958-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)140611193</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Finding a minimal transitive reduction in a strongly connected digraph within linear time</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Zürich</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">24 S.</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 Hochschule <Zürich> / Departement Informatik: Gelbe Berichte des Departements Informatik</subfield><subfield code="v">103</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Departement Informatik: Gelbe Berichte des Departements Informatik</subfield><subfield code="t">Technische Hochschule <Zürich></subfield><subfield code="v">103</subfield><subfield code="w">(DE-604)BV009852642</subfield><subfield code="9">103</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006152250</subfield></datafield></record></collection> |
| id | DE-604.BV009245908 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T09:34:59Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006152250 |
| oclc_num | 46110127 |
| open_access_boolean | |
| owner | DE-29T DE-91G DE-BY-TUM DE-11 |
| owner_facet | DE-29T DE-91G DE-BY-TUM DE-11 |
| physical | 24 S. |
| publishDate | 1989 |
| publishDateSearch | 1989 |
| publishDateSort | 1989 |
| record_format | marc |
| series2 | Technische Hochschule <Zürich> / Departement Informatik: Gelbe Berichte des Departements Informatik |
| spellingShingle | Simon, Klaus 1958- Finding a minimal transitive reduction in a strongly connected digraph within linear time |
| title | Finding a minimal transitive reduction in a strongly connected digraph within linear time |
| title_auth | Finding a minimal transitive reduction in a strongly connected digraph within linear time |
| title_exact_search | Finding a minimal transitive reduction in a strongly connected digraph within linear time |
| title_full | Finding a minimal transitive reduction in a strongly connected digraph within linear time |
| title_fullStr | Finding a minimal transitive reduction in a strongly connected digraph within linear time |
| title_full_unstemmed | Finding a minimal transitive reduction in a strongly connected digraph within linear time |
| title_short | Finding a minimal transitive reduction in a strongly connected digraph within linear time |
| title_sort | finding a minimal transitive reduction in a strongly connected digraph within linear time |
| volume_link | (DE-604)BV009852642 |
| work_keys_str_mv | AT simonklaus findingaminimaltransitivereductioninastronglyconnecteddigraphwithinlineartime |
Order paper/chapter scan
Branch Library Mathematics & Informatics, Reports
| Call Number: |
0111 2001 B 6138-103
Floor plan |
|---|---|
| Copy 1 | Available for loan On Shelf |