Efficient algorithms for listing unlabeled graphs:
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Edinburgh
1990
|
| Series: | University <Edinburgh> / Department of Computer Science: CSR
7 |
| Subjects: | |
| Physical Description: | 14 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008974656 | ||
| 003 | DE-604 | ||
| 005 | 19940721 | ||
| 007 | t | ||
| 008 | 940206s1990 |||| 00||| eng d | ||
| 035 | |a (OCoLC)24327330 | ||
| 035 | |a (DE-599)BVBBV008974656 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T |a DE-91G | ||
| 100 | 1 | |a Henderson, Leslie A. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Efficient algorithms for listing unlabeled graphs |c Leslie Ann Henderson |
| 264 | 1 | |a Edinburgh |c 1990 | |
| 300 | |a 14 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a University <Edinburgh> / Department of Computer Science: CSR |v 7 | |
| 650 | 7 | |a Electronics and electrical engineering, computer science |2 sigle | |
| 650 | 7 | |a Mathematics |2 sigle | |
| 650 | 4 | |a Mathematik | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Graph theory | |
| 810 | 2 | |a Department of Computer Science: CSR |t University <Edinburgh> |v 7 |w (DE-604)BV008906637 |9 7 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005926205 | ||
Record in the Search Index
| _version_ | 1804123312701308928 |
|---|---|
| any_adam_object | |
| author | Henderson, Leslie A. |
| author_facet | Henderson, Leslie A. |
| author_role | aut |
| author_sort | Henderson, Leslie A. |
| author_variant | l a h la lah |
| building | Verbundindex |
| bvnumber | BV008974656 |
| ctrlnum | (OCoLC)24327330 (DE-599)BVBBV008974656 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01043nam a2200325 cb4500</leader><controlfield tag="001">BV008974656</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19940721 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1990 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)24327330</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008974656</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></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Henderson, Leslie A.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Efficient algorithms for listing unlabeled graphs</subfield><subfield code="c">Leslie Ann Henderson</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Edinburgh</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">14 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">University <Edinburgh> / Department of Computer Science: CSR</subfield><subfield code="v">7</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Electronics and electrical engineering, computer science</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Mathematics</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph theory</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: CSR</subfield><subfield code="t">University <Edinburgh></subfield><subfield code="v">7</subfield><subfield code="w">(DE-604)BV008906637</subfield><subfield code="9">7</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005926205</subfield></datafield></record></collection> |
| id | DE-604.BV008974656 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:27:46Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005926205 |
| oclc_num | 24327330 |
| open_access_boolean | |
| owner | DE-29T DE-91G DE-BY-TUM |
| owner_facet | DE-29T DE-91G DE-BY-TUM |
| physical | 14 S. |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| record_format | marc |
| series2 | University <Edinburgh> / Department of Computer Science: CSR |
| spelling | Henderson, Leslie A. Verfasser aut Efficient algorithms for listing unlabeled graphs Leslie Ann Henderson Edinburgh 1990 14 S. txt rdacontent n rdamedia nc rdacarrier University <Edinburgh> / Department of Computer Science: CSR 7 Electronics and electrical engineering, computer science sigle Mathematics sigle Mathematik Algorithms Graph theory Department of Computer Science: CSR University <Edinburgh> 7 (DE-604)BV008906637 7 |
| spellingShingle | Henderson, Leslie A. Efficient algorithms for listing unlabeled graphs Electronics and electrical engineering, computer science sigle Mathematics sigle Mathematik Algorithms Graph theory |
| title | Efficient algorithms for listing unlabeled graphs |
| title_auth | Efficient algorithms for listing unlabeled graphs |
| title_exact_search | Efficient algorithms for listing unlabeled graphs |
| title_full | Efficient algorithms for listing unlabeled graphs Leslie Ann Henderson |
| title_fullStr | Efficient algorithms for listing unlabeled graphs Leslie Ann Henderson |
| title_full_unstemmed | Efficient algorithms for listing unlabeled graphs Leslie Ann Henderson |
| title_short | Efficient algorithms for listing unlabeled graphs |
| title_sort | efficient algorithms for listing unlabeled graphs |
| topic | Electronics and electrical engineering, computer science sigle Mathematics sigle Mathematik Algorithms Graph theory |
| topic_facet | Electronics and electrical engineering, computer science Mathematics Mathematik Algorithms Graph theory |
| volume_link | (DE-604)BV008906637 |
| work_keys_str_mv | AT hendersonlesliea efficientalgorithmsforlistingunlabeledgraphs |