A divide and conquer algorithm for the automatic layout of large directed graphs
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | Undetermined |
| Veröffentlicht: |
Berkeley, Calif.
Electronics Res. Lab.
1988
|
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV005916218 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 930112s1988 d||| |||| 00||| undod | ||
| 035 | |a (OCoLC)630389494 | ||
| 035 | |a (DE-599)BVBBV005916218 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | |a und | ||
| 049 | |a DE-91 | ||
| 088 | |a UCB ERL M89 23 | ||
| 100 | 1 | |a Messinger, Eli B. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a A divide and conquer algorithm for the automatic layout of large directed graphs |c by Eli B. Messinger ; Lawrence A. Rowe ; Robert H. Henry |
| 246 | 1 | 3 | |a UCB ERL M89 23 |
| 264 | 1 | |a Berkeley, Calif. |b Electronics Res. Lab. |c 1988 | |
| 300 | |a 17 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 700 | 1 | |a Rowe, Lawrence A. |e Verfasser |4 aut | |
| 700 | 1 | |a Henry, Robert H. |e Verfasser |4 aut | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-003704842 | ||
Datensatz im Suchindex
| DE-BY-TUM_call_number | 0834/CD.160 |
|---|---|
| DE-BY-TUM_katkey | 574364 |
| DE-BY-TUM_media_number | TEMP2918492 |
| _version_ | 1816711610944716801 |
| any_adam_object | |
| author | Messinger, Eli B. Rowe, Lawrence A. Henry, Robert H. |
| author_facet | Messinger, Eli B. Rowe, Lawrence A. Henry, Robert H. |
| author_role | aut aut aut |
| author_sort | Messinger, Eli B. |
| author_variant | e b m eb ebm l a r la lar r h h rh rhh |
| building | Verbundindex |
| bvnumber | BV005916218 |
| ctrlnum | (OCoLC)630389494 (DE-599)BVBBV005916218 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00928nam a2200289 c 4500</leader><controlfield tag="001">BV005916218</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">930112s1988 d||| |||| 00||| undod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)630389494</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV005916218</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-91</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">UCB ERL M89 23</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Messinger, Eli B.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A divide and conquer algorithm for the automatic layout of large directed graphs</subfield><subfield code="c">by Eli B. Messinger ; Lawrence A. Rowe ; Robert H. Henry</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">UCB ERL M89 23</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berkeley, Calif.</subfield><subfield code="b">Electronics Res. Lab.</subfield><subfield code="c">1988</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">17 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="700" ind1="1" ind2=" "><subfield code="a">Rowe, Lawrence A.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Henry, Robert H.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-003704842</subfield></datafield></record></collection> |
| id | DE-604.BV005916218 |
| illustrated | Illustrated |
| indexdate | 2024-11-25T17:10:36Z |
| institution | BVB |
| language | Undetermined |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-003704842 |
| oclc_num | 630389494 |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM |
| owner_facet | DE-91 DE-BY-TUM |
| physical | 17 S. graph. Darst. |
| publishDate | 1988 |
| publishDateSearch | 1988 |
| publishDateSort | 1988 |
| publisher | Electronics Res. Lab. |
| record_format | marc |
| spellingShingle | Messinger, Eli B. Rowe, Lawrence A. Henry, Robert H. A divide and conquer algorithm for the automatic layout of large directed graphs |
| title | A divide and conquer algorithm for the automatic layout of large directed graphs |
| title_alt | UCB ERL M89 23 |
| title_auth | A divide and conquer algorithm for the automatic layout of large directed graphs |
| title_exact_search | A divide and conquer algorithm for the automatic layout of large directed graphs |
| title_full | A divide and conquer algorithm for the automatic layout of large directed graphs by Eli B. Messinger ; Lawrence A. Rowe ; Robert H. Henry |
| title_fullStr | A divide and conquer algorithm for the automatic layout of large directed graphs by Eli B. Messinger ; Lawrence A. Rowe ; Robert H. Henry |
| title_full_unstemmed | A divide and conquer algorithm for the automatic layout of large directed graphs by Eli B. Messinger ; Lawrence A. Rowe ; Robert H. Henry |
| title_short | A divide and conquer algorithm for the automatic layout of large directed graphs |
| title_sort | a divide and conquer algorithm for the automatic layout of large directed graphs |
| work_keys_str_mv | AT messingerelib adivideandconqueralgorithmfortheautomaticlayoutoflargedirectedgraphs AT rowelawrencea adivideandconqueralgorithmfortheautomaticlayoutoflargedirectedgraphs AT henryroberth adivideandconqueralgorithmfortheautomaticlayoutoflargedirectedgraphs AT messingerelib ucberlm8923 AT rowelawrencea ucberlm8923 AT henryroberth ucberlm8923 |