Threshold graphs and related topics:
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam [u.a.]
Elsevier
1995
|
| Schriftenreihe: | Annals of Discrete Mathematics
56 |
| Schlagworte: | |
| Beschreibung: | XIII, 543 Seiten |
| ISBN: | 0444892877 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010434758 | ||
| 003 | DE-604 | ||
| 005 | 20210318 | ||
| 007 | t | ||
| 008 | 951019s1995 |||| 00||| eng d | ||
| 020 | |a 0444892877 |9 0-444-89287-7 | ||
| 035 | |a (OCoLC)32922027 | ||
| 035 | |a (DE-599)BVBBV010434758 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-91G |a DE-739 |a DE-83 |a DE-188 |a DE-706 | ||
| 050 | 0 | |a QA166 | |
| 082 | 0 | |a 511/.5 |2 20 | |
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 084 | |a 68R10 |2 msc | ||
| 084 | |a MAT 055f |2 stub | ||
| 084 | |a 05Cxx |2 msc | ||
| 100 | 1 | |a Mahadev, N. V. R. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Threshold graphs and related topics |c N. V. R. Mahadev, Northeastern University, Boston, MA, USA, U. N. Peled, University of Illinois at Chicago, Chicago, IL, USA |
| 264 | 1 | |a Amsterdam [u.a.] |b Elsevier |c 1995 | |
| 300 | |a XIII, 543 Seiten | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Annals of Discrete Mathematics |v 56 | |
| 650 | 4 | |a Graphes, Théorie des | |
| 650 | 7 | |a Graphes, théorie des |2 ram | |
| 650 | 7 | |a graphe Ferrers |2 inriac | |
| 650 | 7 | |a graphe différence |2 inriac | |
| 650 | 7 | |a graphe orienté |2 inriac | |
| 650 | 7 | |a graphe à seuil |2 inriac | |
| 650 | 7 | |a matroïde |2 inriac | |
| 650 | 7 | |a méthode décomposition |2 inriac | |
| 650 | 7 | |a problème NP-complet |2 inriac | |
| 650 | 7 | |a seuil |2 inriac | |
| 650 | 7 | |a théorie graphe |2 inriac | |
| 650 | 7 | |a énumération |2 inriac | |
| 650 | 4 | |a Graph theory | |
| 650 | 0 | 7 | |a Graphentheorie |0 (DE-588)4113782-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Perfekter Graph |0 (DE-588)4173735-0 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Perfekter Graph |0 (DE-588)4173735-0 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Graphentheorie |0 (DE-588)4113782-6 |D s |
| 689 | 1 | |8 1\p |5 DE-604 | |
| 700 | 1 | |a Peled, U. N. |e Verfasser |0 (DE-588)128069937 |4 aut | |
| 830 | 0 | |a Annals of Discrete Mathematics |v 56 |w (DE-604)BV004511910 |9 56 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006953390 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804124867543433216 |
|---|---|
| any_adam_object | |
| author | Mahadev, N. V. R. Peled, U. N. |
| author_GND | (DE-588)128069937 |
| author_facet | Mahadev, N. V. R. Peled, U. N. |
| author_role | aut aut |
| author_sort | Mahadev, N. V. R. |
| author_variant | n v r m nvr nvrm u n p un unp |
| building | Verbundindex |
| bvnumber | BV010434758 |
| callnumber-first | Q - Science |
| callnumber-label | QA166 |
| callnumber-raw | QA166 |
| callnumber-search | QA166 |
| callnumber-sort | QA 3166 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SK 890 |
| classification_tum | MAT 055f |
| ctrlnum | (OCoLC)32922027 (DE-599)BVBBV010434758 |
| dewey-full | 511/.5 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511/.5 |
| dewey-search | 511/.5 |
| dewey-sort | 3511 15 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02101nam a2200601 cb4500</leader><controlfield tag="001">BV010434758</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20210318 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">951019s1995 |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0444892877</subfield><subfield code="9">0-444-89287-7</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)32922027</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010434758</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-12</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-706</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA166</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511/.5</subfield><subfield code="2">20</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 890</subfield><subfield code="0">(DE-625)143267:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">68R10</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 055f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">05Cxx</subfield><subfield code="2">msc</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Mahadev, N. V. R.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Threshold graphs and related topics</subfield><subfield code="c">N. V. R. Mahadev, Northeastern University, Boston, MA, USA, U. N. Peled, University of Illinois at Chicago, Chicago, IL, USA</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam [u.a.]</subfield><subfield code="b">Elsevier</subfield><subfield code="c">1995</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIII, 543 Seiten</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">Annals of Discrete Mathematics</subfield><subfield code="v">56</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graphes, Théorie des</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Graphes, théorie des</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">graphe Ferrers</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">graphe différence</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">graphe orienté</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">graphe à seuil</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">matroïde</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">méthode décomposition</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">problème NP-complet</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">seuil</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">théorie graphe</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">énumération</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph theory</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Perfekter Graph</subfield><subfield code="0">(DE-588)4173735-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Perfekter Graph</subfield><subfield code="0">(DE-588)4173735-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Peled, U. N.</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)128069937</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Annals of Discrete Mathematics</subfield><subfield code="v">56</subfield><subfield code="w">(DE-604)BV004511910</subfield><subfield code="9">56</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006953390</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
| id | DE-604.BV010434758 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:52:29Z |
| institution | BVB |
| isbn | 0444892877 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006953390 |
| oclc_num | 32922027 |
| open_access_boolean | |
| owner | DE-12 DE-91G DE-BY-TUM DE-739 DE-83 DE-188 DE-706 |
| owner_facet | DE-12 DE-91G DE-BY-TUM DE-739 DE-83 DE-188 DE-706 |
| physical | XIII, 543 Seiten |
| publishDate | 1995 |
| publishDateSearch | 1995 |
| publishDateSort | 1995 |
| publisher | Elsevier |
| record_format | marc |
| series | Annals of Discrete Mathematics |
| series2 | Annals of Discrete Mathematics |
| spelling | Mahadev, N. V. R. Verfasser aut Threshold graphs and related topics N. V. R. Mahadev, Northeastern University, Boston, MA, USA, U. N. Peled, University of Illinois at Chicago, Chicago, IL, USA Amsterdam [u.a.] Elsevier 1995 XIII, 543 Seiten txt rdacontent n rdamedia nc rdacarrier Annals of Discrete Mathematics 56 Graphes, Théorie des Graphes, théorie des ram graphe Ferrers inriac graphe différence inriac graphe orienté inriac graphe à seuil inriac matroïde inriac méthode décomposition inriac problème NP-complet inriac seuil inriac théorie graphe inriac énumération inriac Graph theory Graphentheorie (DE-588)4113782-6 gnd rswk-swf Perfekter Graph (DE-588)4173735-0 gnd rswk-swf Perfekter Graph (DE-588)4173735-0 s DE-604 Graphentheorie (DE-588)4113782-6 s 1\p DE-604 Peled, U. N. Verfasser (DE-588)128069937 aut Annals of Discrete Mathematics 56 (DE-604)BV004511910 56 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Mahadev, N. V. R. Peled, U. N. Threshold graphs and related topics Annals of Discrete Mathematics Graphes, Théorie des Graphes, théorie des ram graphe Ferrers inriac graphe différence inriac graphe orienté inriac graphe à seuil inriac matroïde inriac méthode décomposition inriac problème NP-complet inriac seuil inriac théorie graphe inriac énumération inriac Graph theory Graphentheorie (DE-588)4113782-6 gnd Perfekter Graph (DE-588)4173735-0 gnd |
| subject_GND | (DE-588)4113782-6 (DE-588)4173735-0 |
| title | Threshold graphs and related topics |
| title_auth | Threshold graphs and related topics |
| title_exact_search | Threshold graphs and related topics |
| title_full | Threshold graphs and related topics N. V. R. Mahadev, Northeastern University, Boston, MA, USA, U. N. Peled, University of Illinois at Chicago, Chicago, IL, USA |
| title_fullStr | Threshold graphs and related topics N. V. R. Mahadev, Northeastern University, Boston, MA, USA, U. N. Peled, University of Illinois at Chicago, Chicago, IL, USA |
| title_full_unstemmed | Threshold graphs and related topics N. V. R. Mahadev, Northeastern University, Boston, MA, USA, U. N. Peled, University of Illinois at Chicago, Chicago, IL, USA |
| title_short | Threshold graphs and related topics |
| title_sort | threshold graphs and related topics |
| topic | Graphes, Théorie des Graphes, théorie des ram graphe Ferrers inriac graphe différence inriac graphe orienté inriac graphe à seuil inriac matroïde inriac méthode décomposition inriac problème NP-complet inriac seuil inriac théorie graphe inriac énumération inriac Graph theory Graphentheorie (DE-588)4113782-6 gnd Perfekter Graph (DE-588)4173735-0 gnd |
| topic_facet | Graphes, Théorie des Graphes, théorie des graphe Ferrers graphe différence graphe orienté graphe à seuil matroïde méthode décomposition problème NP-complet seuil théorie graphe énumération Graph theory Graphentheorie Perfekter Graph |
| volume_link | (DE-604)BV004511910 |
| work_keys_str_mv | AT mahadevnvr thresholdgraphsandrelatedtopics AT peledun thresholdgraphsandrelatedtopics |