The perils of indirect proof or another efficient search algorithm to find the elementary circuits of directed graphs:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Newcastle upon Tyne
1973
|
| Schriftenreihe: | Computing Laboratory <Newcastle-upon-Tyne>: Technical report series
42 |
| Beschreibung: | 19 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009075853 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940227s1973 |||| 00||| eng d | ||
| 035 | |a (OCoLC)56027616 | ||
| 035 | |a (DE-599)BVBBV009075853 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Lauer, Peter E. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a The perils of indirect proof or another efficient search algorithm to find the elementary circuits of directed graphs |
| 264 | 1 | |a Newcastle upon Tyne |c 1973 | |
| 300 | |a 19 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 42 | |
| 830 | 0 | |a Computing Laboratory <Newcastle-upon-Tyne>: Technical report series |v 42 |w (DE-604)BV008912269 |9 42 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006013180 | ||
Datensatz im Suchindex
| _version_ | 1804123489751269376 |
|---|---|
| any_adam_object | |
| author | Lauer, Peter E. |
| author_facet | Lauer, Peter E. |
| author_role | aut |
| author_sort | Lauer, Peter E. |
| author_variant | p e l pe pel |
| building | Verbundindex |
| bvnumber | BV009075853 |
| ctrlnum | (OCoLC)56027616 (DE-599)BVBBV009075853 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00910nam a2200265 cb4500</leader><controlfield tag="001">BV009075853</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940227s1973 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)56027616</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009075853</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="100" ind1="1" ind2=" "><subfield code="a">Lauer, Peter E.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The perils of indirect proof or another efficient search algorithm to find the elementary circuits of directed graphs</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Newcastle upon Tyne</subfield><subfield code="c">1973</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">19 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">42</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Computing Laboratory <Newcastle-upon-Tyne>: Technical report series</subfield><subfield code="v">42</subfield><subfield code="w">(DE-604)BV008912269</subfield><subfield code="9">42</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006013180</subfield></datafield></record></collection> |
| id | DE-604.BV009075853 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:30:35Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006013180 |
| oclc_num | 56027616 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 19 S. |
| publishDate | 1973 |
| publishDateSearch | 1973 |
| publishDateSort | 1973 |
| record_format | marc |
| series | Computing Laboratory <Newcastle-upon-Tyne>: Technical report series |
| series2 | Computing Laboratory <Newcastle-upon-Tyne>: Technical report series |
| spelling | Lauer, Peter E. Verfasser aut The perils of indirect proof or another efficient search algorithm to find the elementary circuits of directed graphs Newcastle upon Tyne 1973 19 S. txt rdacontent n rdamedia nc rdacarrier Computing Laboratory <Newcastle-upon-Tyne>: Technical report series 42 Computing Laboratory <Newcastle-upon-Tyne>: Technical report series 42 (DE-604)BV008912269 42 |
| spellingShingle | Lauer, Peter E. The perils of indirect proof or another efficient search algorithm to find the elementary circuits of directed graphs Computing Laboratory <Newcastle-upon-Tyne>: Technical report series |
| title | The perils of indirect proof or another efficient search algorithm to find the elementary circuits of directed graphs |
| title_auth | The perils of indirect proof or another efficient search algorithm to find the elementary circuits of directed graphs |
| title_exact_search | The perils of indirect proof or another efficient search algorithm to find the elementary circuits of directed graphs |
| title_full | The perils of indirect proof or another efficient search algorithm to find the elementary circuits of directed graphs |
| title_fullStr | The perils of indirect proof or another efficient search algorithm to find the elementary circuits of directed graphs |
| title_full_unstemmed | The perils of indirect proof or another efficient search algorithm to find the elementary circuits of directed graphs |
| title_short | The perils of indirect proof or another efficient search algorithm to find the elementary circuits of directed graphs |
| title_sort | the perils of indirect proof or another efficient search algorithm to find the elementary circuits of directed graphs |
| volume_link | (DE-604)BV008912269 |
| work_keys_str_mv | AT lauerpetere theperilsofindirectprooforanotherefficientsearchalgorithmtofindtheelementarycircuitsofdirectedgraphs |