Finding strongly connected components of a directed graph:
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Newcastle upon Tyne
1977
|
| Schriftenreihe: | Computing Laboratory <Newcastle-upon-Tyne>: Technical report series
101 |
| Schlagworte: | |
| Beschreibung: | 13 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009075876 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940227s1977 |||| 00||| eng d | ||
| 035 | |a (OCoLC)55552426 | ||
| 035 | |a (DE-599)BVBBV009075876 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 082 | 1 | |a 511.5 | |
| 100 | 1 | |a Eve, James |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Finding strongly connected components of a directed graph |c James Eve ; Reino Kurki-Suonio* |
| 264 | 1 | |a Newcastle upon Tyne |c 1977 | |
| 300 | |a 13 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Computing Laboratory <Newcastle-upon-Tyne>: Technical report series |v 101 | |
| 650 | 4 | |a Graph theory | |
| 700 | 1 | |a Kurki-Suonio, Reino |e Verfasser |4 aut | |
| 830 | 0 | |a Computing Laboratory <Newcastle-upon-Tyne>: Technical report series |v 101 |w (DE-604)BV008912269 |9 101 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006013203 | ||
Datensatz im Suchindex
| _version_ | 1804123489799503872 |
|---|---|
| any_adam_object | |
| author | Eve, James Kurki-Suonio, Reino |
| author_facet | Eve, James Kurki-Suonio, Reino |
| author_role | aut aut |
| author_sort | Eve, James |
| author_variant | j e je r k s rks |
| building | Verbundindex |
| bvnumber | BV009075876 |
| ctrlnum | (OCoLC)55552426 (DE-599)BVBBV009075876 |
| dewey-full | 511.5 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.5 |
| dewey-search | 511.5 |
| dewey-sort | 3511.5 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00980nam a2200301 cb4500</leader><controlfield tag="001">BV009075876</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940227s1977 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)55552426</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009075876</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></datafield><datafield tag="082" ind1="1" ind2=" "><subfield code="a">511.5</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Eve, James</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Finding strongly connected components of a directed graph</subfield><subfield code="c">James Eve ; Reino Kurki-Suonio*</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Newcastle upon Tyne</subfield><subfield code="c">1977</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">13 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">Computing Laboratory <Newcastle-upon-Tyne>: Technical report series</subfield><subfield code="v">101</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph theory</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kurki-Suonio, Reino</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Computing Laboratory <Newcastle-upon-Tyne>: Technical report series</subfield><subfield code="v">101</subfield><subfield code="w">(DE-604)BV008912269</subfield><subfield code="9">101</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006013203</subfield></datafield></record></collection> |
| id | DE-604.BV009075876 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:30:35Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006013203 |
| oclc_num | 55552426 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 13 S. |
| publishDate | 1977 |
| publishDateSearch | 1977 |
| publishDateSort | 1977 |
| record_format | marc |
| series | Computing Laboratory <Newcastle-upon-Tyne>: Technical report series |
| series2 | Computing Laboratory <Newcastle-upon-Tyne>: Technical report series |
| spelling | Eve, James Verfasser aut Finding strongly connected components of a directed graph James Eve ; Reino Kurki-Suonio* Newcastle upon Tyne 1977 13 S. txt rdacontent n rdamedia nc rdacarrier Computing Laboratory <Newcastle-upon-Tyne>: Technical report series 101 Graph theory Kurki-Suonio, Reino Verfasser aut Computing Laboratory <Newcastle-upon-Tyne>: Technical report series 101 (DE-604)BV008912269 101 |
| spellingShingle | Eve, James Kurki-Suonio, Reino Finding strongly connected components of a directed graph Computing Laboratory <Newcastle-upon-Tyne>: Technical report series Graph theory |
| title | Finding strongly connected components of a directed graph |
| title_auth | Finding strongly connected components of a directed graph |
| title_exact_search | Finding strongly connected components of a directed graph |
| title_full | Finding strongly connected components of a directed graph James Eve ; Reino Kurki-Suonio* |
| title_fullStr | Finding strongly connected components of a directed graph James Eve ; Reino Kurki-Suonio* |
| title_full_unstemmed | Finding strongly connected components of a directed graph James Eve ; Reino Kurki-Suonio* |
| title_short | Finding strongly connected components of a directed graph |
| title_sort | finding strongly connected components of a directed graph |
| topic | Graph theory |
| topic_facet | Graph theory |
| volume_link | (DE-604)BV008912269 |
| work_keys_str_mv | AT evejames findingstronglyconnectedcomponentsofadirectedgraph AT kurkisuonioreino findingstronglyconnectedcomponentsofadirectedgraph |