Algorithms for finding maximum bipartite subgraphs:
Gespeichert in:
| Beteiligte Personen: | , |
|---|---|
| Format: | Buch |
| Sprache: | Englisch Polnisch |
| Veröffentlicht: |
Warszawa, Poland
1991
|
| Schriftenreihe: | Instytut Podstaw Informatyki <Warszawa>: Prace IPI PAN
701 |
| Beschreibung: | Zsfassung in poln. Sprache |
| Umfang: | 14 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV011013146 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t| | ||
| 008 | 961021s1991 xx |||| 00||| engod | ||
| 035 | |a (OCoLC)169103961 | ||
| 035 | |a (DE-599)BVBBV011013146 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng |a pol | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Bylka, Stanisław |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Algorithms for finding maximum bipartite subgraphs |c Stanisław Bylka ; Adam Idzik |
| 264 | 1 | |a Warszawa, Poland |c 1991 | |
| 300 | |a 14 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Instytut Podstaw Informatyki <Warszawa>: Prace IPI PAN |v 701 | |
| 500 | |a Zsfassung in poln. Sprache | ||
| 700 | 1 | |a Idzik, Adam |e Verfasser |4 aut | |
| 830 | 0 | |a Instytut Podstaw Informatyki <Warszawa>: Prace IPI PAN |v 701 |w (DE-604)BV005632354 |9 701 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-007372460 | |
Datensatz im Suchindex
| DE-BY-TUM_call_number | 0111 2001 B 6133-701 |
|---|---|
| DE-BY-TUM_katkey | 770890 |
| DE-BY-TUM_location | 01 |
| DE-BY-TUM_media_number | 040010164755 |
| _version_ | 1821938572966494208 |
| any_adam_object | |
| author | Bylka, Stanisław Idzik, Adam |
| author_facet | Bylka, Stanisław Idzik, Adam |
| author_role | aut aut |
| author_sort | Bylka, Stanisław |
| author_variant | s b sb a i ai |
| building | Verbundindex |
| bvnumber | BV011013146 |
| ctrlnum | (OCoLC)169103961 (DE-599)BVBBV011013146 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00940nam a2200289 cb4500</leader><controlfield tag="001">BV011013146</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">961021s1991 xx |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)169103961</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011013146</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><subfield code="a">pol</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bylka, Stanisław</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithms for finding maximum bipartite subgraphs</subfield><subfield code="c">Stanisław Bylka ; Adam Idzik</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Warszawa, Poland</subfield><subfield code="c">1991</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">Instytut Podstaw Informatyki <Warszawa>: Prace IPI PAN</subfield><subfield code="v">701</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Zsfassung in poln. Sprache</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Idzik, Adam</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Instytut Podstaw Informatyki <Warszawa>: Prace IPI PAN</subfield><subfield code="v">701</subfield><subfield code="w">(DE-604)BV005632354</subfield><subfield code="9">701</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007372460</subfield></datafield></record></collection> |
| id | DE-604.BV011013146 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T10:04:49Z |
| institution | BVB |
| language | English Polish |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007372460 |
| oclc_num | 169103961 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 14 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series | Instytut Podstaw Informatyki <Warszawa>: Prace IPI PAN |
| series2 | Instytut Podstaw Informatyki <Warszawa>: Prace IPI PAN |
| spellingShingle | Bylka, Stanisław Idzik, Adam Algorithms for finding maximum bipartite subgraphs Instytut Podstaw Informatyki <Warszawa>: Prace IPI PAN |
| title | Algorithms for finding maximum bipartite subgraphs |
| title_auth | Algorithms for finding maximum bipartite subgraphs |
| title_exact_search | Algorithms for finding maximum bipartite subgraphs |
| title_full | Algorithms for finding maximum bipartite subgraphs Stanisław Bylka ; Adam Idzik |
| title_fullStr | Algorithms for finding maximum bipartite subgraphs Stanisław Bylka ; Adam Idzik |
| title_full_unstemmed | Algorithms for finding maximum bipartite subgraphs Stanisław Bylka ; Adam Idzik |
| title_short | Algorithms for finding maximum bipartite subgraphs |
| title_sort | algorithms for finding maximum bipartite subgraphs |
| volume_link | (DE-604)BV005632354 |
| work_keys_str_mv | AT bylkastanisław algorithmsforfindingmaximumbipartitesubgraphs AT idzikadam algorithmsforfindingmaximumbipartitesubgraphs |
Paper/Kapitel scannen lassen
Teilbibliothek Mathematik & Informatik, Berichte
| Signatur: |
0111 2001 B 6133-701
Lageplan |
|---|---|
| Exemplar 1 | Ausleihbar Am Standort |