The computational complexity of graph problems with siccinct multigraph representation:
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | Undetermined |
| Veröffentlicht: |
Augsburg
1987
|
| Schriftenreihe: | Institut für Mathematik <Augsburg>: Report
164 |
| Beschreibung: | 10 Bl. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV000753598 | ||
| 003 | DE-604 | ||
| 005 | 20031028 | ||
| 007 | t | ||
| 008 | 880531s1987 |||| 00||| und d | ||
| 035 | |a (OCoLC)644957124 | ||
| 035 | |a (DE-599)BVBBV000753598 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | |a und | ||
| 049 | |a DE-12 | ||
| 100 | 1 | |a Karpiński, Marek |d 1948- |e Verfasser |0 (DE-588)115476032 |4 aut | |
| 245 | 1 | 0 | |a The computational complexity of graph problems with siccinct multigraph representation |c Marke Karinski ; Klaus W. Wagner |
| 264 | 1 | |a Augsburg |c 1987 | |
| 300 | |a 10 Bl. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Institut für Mathematik <Augsburg>: Report |v 164 | |
| 700 | 1 | |a Wagner, Klaus W. |e Verfasser |4 aut | |
| 830 | 0 | |a Institut für Mathematik <Augsburg>: Report |v 164 |w (DE-604)BV000666245 |9 164 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-000471651 | ||
Datensatz im Suchindex
| _version_ | 1804115205792202752 |
|---|---|
| any_adam_object | |
| author | Karpiński, Marek 1948- Wagner, Klaus W. |
| author_GND | (DE-588)115476032 |
| author_facet | Karpiński, Marek 1948- Wagner, Klaus W. |
| author_role | aut aut |
| author_sort | Karpiński, Marek 1948- |
| author_variant | m k mk k w w kw kww |
| building | Verbundindex |
| bvnumber | BV000753598 |
| ctrlnum | (OCoLC)644957124 (DE-599)BVBBV000753598 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00935nam a2200277 cb4500</leader><controlfield tag="001">BV000753598</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20031028 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">880531s1987 |||| 00||| und d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)644957124</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV000753598</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-12</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Karpiński, Marek</subfield><subfield code="d">1948-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)115476032</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The computational complexity of graph problems with siccinct multigraph representation</subfield><subfield code="c">Marke Karinski ; Klaus W. Wagner</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Augsburg</subfield><subfield code="c">1987</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">10 Bl.</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 Mathematik <Augsburg>: Report</subfield><subfield code="v">164</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wagner, Klaus W.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Institut für Mathematik <Augsburg>: Report</subfield><subfield code="v">164</subfield><subfield code="w">(DE-604)BV000666245</subfield><subfield code="9">164</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-000471651</subfield></datafield></record></collection> |
| id | DE-604.BV000753598 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T15:18:55Z |
| institution | BVB |
| language | Undetermined |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-000471651 |
| oclc_num | 644957124 |
| open_access_boolean | |
| owner | DE-12 |
| owner_facet | DE-12 |
| physical | 10 Bl. |
| publishDate | 1987 |
| publishDateSearch | 1987 |
| publishDateSort | 1987 |
| record_format | marc |
| series | Institut für Mathematik <Augsburg>: Report |
| series2 | Institut für Mathematik <Augsburg>: Report |
| spelling | Karpiński, Marek 1948- Verfasser (DE-588)115476032 aut The computational complexity of graph problems with siccinct multigraph representation Marke Karinski ; Klaus W. Wagner Augsburg 1987 10 Bl. txt rdacontent n rdamedia nc rdacarrier Institut für Mathematik <Augsburg>: Report 164 Wagner, Klaus W. Verfasser aut Institut für Mathematik <Augsburg>: Report 164 (DE-604)BV000666245 164 |
| spellingShingle | Karpiński, Marek 1948- Wagner, Klaus W. The computational complexity of graph problems with siccinct multigraph representation Institut für Mathematik <Augsburg>: Report |
| title | The computational complexity of graph problems with siccinct multigraph representation |
| title_auth | The computational complexity of graph problems with siccinct multigraph representation |
| title_exact_search | The computational complexity of graph problems with siccinct multigraph representation |
| title_full | The computational complexity of graph problems with siccinct multigraph representation Marke Karinski ; Klaus W. Wagner |
| title_fullStr | The computational complexity of graph problems with siccinct multigraph representation Marke Karinski ; Klaus W. Wagner |
| title_full_unstemmed | The computational complexity of graph problems with siccinct multigraph representation Marke Karinski ; Klaus W. Wagner |
| title_short | The computational complexity of graph problems with siccinct multigraph representation |
| title_sort | the computational complexity of graph problems with siccinct multigraph representation |
| volume_link | (DE-604)BV000666245 |
| work_keys_str_mv | AT karpinskimarek thecomputationalcomplexityofgraphproblemswithsiccinctmultigraphrepresentation AT wagnerklausw thecomputationalcomplexityofgraphproblemswithsiccinctmultigraphrepresentation |