On finding the vertex connectivity of graphs:
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Urbana, Ill.
1987
|
| Series: | Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report
669 |
| Subjects: | |
| Physical Description: | 5 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009245664 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940313s1987 |||| 00||| eng d | ||
| 035 | |a (OCoLC)19787116 | ||
| 035 | |a (DE-599)BVBBV009245664 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Girkar, Milind |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a On finding the vertex connectivity of graphs |c Milind Girkar and Milind Sohoni |
| 264 | 1 | |a Urbana, Ill. |c 1987 | |
| 300 | |a 5 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report |v 669 | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Graph theory | |
| 700 | 1 | |a Sohoni, Milind |e Verfasser |4 aut | |
| 830 | 0 | |a Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report |v 669 |w (DE-604)BV008930033 |9 669 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006152010 | ||
Record in the Search Index
| _version_ | 1804123692880363520 |
|---|---|
| any_adam_object | |
| author | Girkar, Milind Sohoni, Milind |
| author_facet | Girkar, Milind Sohoni, Milind |
| author_role | aut aut |
| author_sort | Girkar, Milind |
| author_variant | m g mg m s ms |
| building | Verbundindex |
| bvnumber | BV009245664 |
| ctrlnum | (OCoLC)19787116 (DE-599)BVBBV009245664 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00985nam a2200301 cb4500</leader><controlfield tag="001">BV009245664</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940313s1987 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)19787116</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009245664</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">Girkar, Milind</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On finding the vertex connectivity of graphs</subfield><subfield code="c">Milind Girkar and Milind Sohoni</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Urbana, Ill.</subfield><subfield code="c">1987</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">5 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">Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report</subfield><subfield code="v">669</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="700" ind1="1" ind2=" "><subfield code="a">Sohoni, Milind</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report</subfield><subfield code="v">669</subfield><subfield code="w">(DE-604)BV008930033</subfield><subfield code="9">669</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006152010</subfield></datafield></record></collection> |
| id | DE-604.BV009245664 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:33:49Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006152010 |
| oclc_num | 19787116 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 5 S. |
| publishDate | 1987 |
| publishDateSearch | 1987 |
| publishDateSort | 1987 |
| record_format | marc |
| series | Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report |
| series2 | Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report |
| spelling | Girkar, Milind Verfasser aut On finding the vertex connectivity of graphs Milind Girkar and Milind Sohoni Urbana, Ill. 1987 5 S. txt rdacontent n rdamedia nc rdacarrier Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report 669 Algorithms Graph theory Sohoni, Milind Verfasser aut Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report 669 (DE-604)BV008930033 669 |
| spellingShingle | Girkar, Milind Sohoni, Milind On finding the vertex connectivity of graphs Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report Algorithms Graph theory |
| title | On finding the vertex connectivity of graphs |
| title_auth | On finding the vertex connectivity of graphs |
| title_exact_search | On finding the vertex connectivity of graphs |
| title_full | On finding the vertex connectivity of graphs Milind Girkar and Milind Sohoni |
| title_fullStr | On finding the vertex connectivity of graphs Milind Girkar and Milind Sohoni |
| title_full_unstemmed | On finding the vertex connectivity of graphs Milind Girkar and Milind Sohoni |
| title_short | On finding the vertex connectivity of graphs |
| title_sort | on finding the vertex connectivity of graphs |
| topic | Algorithms Graph theory |
| topic_facet | Algorithms Graph theory |
| volume_link | (DE-604)BV008930033 |
| work_keys_str_mv | AT girkarmilind onfindingthevertexconnectivityofgraphs AT sohonimilind onfindingthevertexconnectivityofgraphs |