On the complexity of recognizing perfectly orderable graphs:
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | Undetermined |
| Veröffentlicht: |
Bonn
1989
|
| Schriftenreihe: | Institut für Ökonometrie und Operations Research <Bonn>: Report
594. |
| Beschreibung: | 7 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV004281431 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 910313s1989 d||| |||| 00||| und d | ||
| 035 | |a (OCoLC)46123248 | ||
| 035 | |a (DE-599)BVBBV004281431 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | |a und | ||
| 049 | |a DE-523 | ||
| 100 | 1 | |a Middendorf, Matthias |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a On the complexity of recognizing perfectly orderable graphs |c Matthias Middendorf ; Frank Pfeiffer |
| 264 | 1 | |a Bonn |c 1989 | |
| 300 | |a 7 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Institut für Ökonometrie und Operations Research <Bonn>: Report |v 594. | |
| 700 | 1 | |a Pfeiffer, Frank |e Verfasser |4 aut | |
| 830 | 0 | |a Institut für Ökonometrie und Operations Research <Bonn>: Report |v 594. |w (DE-604)BV000010784 |9 594. | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-002662604 | ||
Datensatz im Suchindex
| _version_ | 1804118474506633216 |
|---|---|
| any_adam_object | |
| author | Middendorf, Matthias Pfeiffer, Frank |
| author_facet | Middendorf, Matthias Pfeiffer, Frank |
| author_role | aut aut |
| author_sort | Middendorf, Matthias |
| author_variant | m m mm f p fp |
| building | Verbundindex |
| bvnumber | BV004281431 |
| ctrlnum | (OCoLC)46123248 (DE-599)BVBBV004281431 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00940nam a2200277 cb4500</leader><controlfield tag="001">BV004281431</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">910313s1989 d||| |||| 00||| und d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)46123248</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV004281431</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-523</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Middendorf, Matthias</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On the complexity of recognizing perfectly orderable graphs</subfield><subfield code="c">Matthias Middendorf ; Frank Pfeiffer</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Bonn</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">7 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="490" ind1="1" ind2=" "><subfield code="a">Institut für Ökonometrie und Operations Research <Bonn>: Report</subfield><subfield code="v">594.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Pfeiffer, Frank</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Institut für Ökonometrie und Operations Research <Bonn>: Report</subfield><subfield code="v">594.</subfield><subfield code="w">(DE-604)BV000010784</subfield><subfield code="9">594.</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-002662604</subfield></datafield></record></collection> |
| id | DE-604.BV004281431 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T16:10:52Z |
| institution | BVB |
| language | Undetermined |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-002662604 |
| oclc_num | 46123248 |
| open_access_boolean | |
| owner | DE-523 |
| owner_facet | DE-523 |
| physical | 7 S. graph. Darst. |
| publishDate | 1989 |
| publishDateSearch | 1989 |
| publishDateSort | 1989 |
| record_format | marc |
| series | Institut für Ökonometrie und Operations Research <Bonn>: Report |
| series2 | Institut für Ökonometrie und Operations Research <Bonn>: Report |
| spelling | Middendorf, Matthias Verfasser aut On the complexity of recognizing perfectly orderable graphs Matthias Middendorf ; Frank Pfeiffer Bonn 1989 7 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Institut für Ökonometrie und Operations Research <Bonn>: Report 594. Pfeiffer, Frank Verfasser aut Institut für Ökonometrie und Operations Research <Bonn>: Report 594. (DE-604)BV000010784 594. |
| spellingShingle | Middendorf, Matthias Pfeiffer, Frank On the complexity of recognizing perfectly orderable graphs Institut für Ökonometrie und Operations Research <Bonn>: Report |
| title | On the complexity of recognizing perfectly orderable graphs |
| title_auth | On the complexity of recognizing perfectly orderable graphs |
| title_exact_search | On the complexity of recognizing perfectly orderable graphs |
| title_full | On the complexity of recognizing perfectly orderable graphs Matthias Middendorf ; Frank Pfeiffer |
| title_fullStr | On the complexity of recognizing perfectly orderable graphs Matthias Middendorf ; Frank Pfeiffer |
| title_full_unstemmed | On the complexity of recognizing perfectly orderable graphs Matthias Middendorf ; Frank Pfeiffer |
| title_short | On the complexity of recognizing perfectly orderable graphs |
| title_sort | on the complexity of recognizing perfectly orderable graphs |
| volume_link | (DE-604)BV000010784 |
| work_keys_str_mv | AT middendorfmatthias onthecomplexityofrecognizingperfectlyorderablegraphs AT pfeifferfrank onthecomplexityofrecognizingperfectlyorderablegraphs |