Matroid Theory and its Applications in Electric Network Theory and in Statics:
Gespeichert in:
Beteilige Person: | |
---|---|
Format: | Elektronisch E-Book |
Sprache: | Englisch |
Veröffentlicht: |
Berlin, Heidelberg
Springer Berlin Heidelberg
1989
|
Schriftenreihe: | Algorithms and Combinatorics
6 |
Schlagwörter: | |
Links: | https://doi.org/10.1007/978-3-662-22143-3 |
Beschreibung: | I. The topics of this book The concept of a matroid has been known for more than five decades. Whitney (1935) introduced it as a common generalization of graphs and matrices. In the last two decades, it has become clear how important the concept is, for the following reasons: (1) Combinatorics (or discrete mathematics) was considered by many to be a collection of interesting, sometimes deep, but mostly unrelated ideas. However, like other branches of mathematics, combinatorics also encompasses some general tools that can be learned and then applied, to various problems. Matroid theory is one of these tools. (2) Within combinatorics, the relative importance of algorithms has increased with the spread of computers. Classical analysis did not even consider problems where "only" a finite number of cases were to be studied. Now such problems are not only considered, but their complexity is often analyzed in considerable detail. Some questions of this type (for example, the determination of when the so called "greedy" algorithm is optimal) cannot even be answered without matroidal tools |
Umfang: | 1 Online-Ressource (XIII, 533 p) |
ISBN: | 9783662221433 9783662221457 |
ISSN: | 0937-5511 |
DOI: | 10.1007/978-3-662-22143-3 |
Internformat
MARC
LEADER | 00000nam a2200000zcb4500 | ||
---|---|---|---|
001 | BV042423509 | ||
003 | DE-604 | ||
005 | 20171019 | ||
007 | cr|uuu---uuuuu | ||
008 | 150317s1989 xx o|||| 00||| eng d | ||
020 | |a 9783662221433 |c Online |9 978-3-662-22143-3 | ||
020 | |a 9783662221457 |c Print |9 978-3-662-22145-7 | ||
024 | 7 | |a 10.1007/978-3-662-22143-3 |2 doi | |
035 | |a (OCoLC)864110910 | ||
035 | |a (DE-599)BVBBV042423509 | ||
040 | |a DE-604 |b ger |e aacr | ||
041 | 0 | |a eng | |
049 | |a DE-384 |a DE-703 |a DE-91 |a DE-634 | ||
082 | 0 | |a 511.6 |2 23 | |
084 | |a MAT 000 |2 stub | ||
100 | 1 | |a Recski, András |e Verfasser |0 (DE-588)170541177 |4 aut | |
245 | 1 | 0 | |a Matroid Theory and its Applications in Electric Network Theory and in Statics |c by András Recski |
264 | 1 | |a Berlin, Heidelberg |b Springer Berlin Heidelberg |c 1989 | |
300 | |a 1 Online-Ressource (XIII, 533 p) | ||
336 | |b txt |2 rdacontent | ||
337 | |b c |2 rdamedia | ||
338 | |b cr |2 rdacarrier | ||
490 | 1 | |a Algorithms and Combinatorics |v 6 |x 0937-5511 | |
500 | |a I. The topics of this book The concept of a matroid has been known for more than five decades. Whitney (1935) introduced it as a common generalization of graphs and matrices. In the last two decades, it has become clear how important the concept is, for the following reasons: (1) Combinatorics (or discrete mathematics) was considered by many to be a collection of interesting, sometimes deep, but mostly unrelated ideas. However, like other branches of mathematics, combinatorics also encompasses some general tools that can be learned and then applied, to various problems. Matroid theory is one of these tools. (2) Within combinatorics, the relative importance of algorithms has increased with the spread of computers. Classical analysis did not even consider problems where "only" a finite number of cases were to be studied. Now such problems are not only considered, but their complexity is often analyzed in considerable detail. Some questions of this type (for example, the determination of when the so called "greedy" algorithm is optimal) cannot even be answered without matroidal tools | ||
650 | 4 | |a Mathematics | |
650 | 4 | |a Combinatorics | |
650 | 4 | |a Geometry | |
650 | 4 | |a Topology | |
650 | 4 | |a Engineering mathematics | |
650 | 4 | |a Computer engineering | |
650 | 4 | |a Appl.Mathematics/Computational Methods of Engineering | |
650 | 4 | |a Electrical Engineering | |
650 | 4 | |a Mathematik | |
650 | 0 | 7 | |a Elektrisches Netzwerk |0 (DE-588)4014214-0 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Matroid |0 (DE-588)4128705-8 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Statik |0 (DE-588)4056987-1 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Elektrisches Netzwerk |0 (DE-588)4014214-0 |D s |
689 | 0 | 1 | |a Matroid |0 (DE-588)4128705-8 |D s |
689 | 0 | |8 1\p |5 DE-604 | |
689 | 1 | 0 | |a Statik |0 (DE-588)4056987-1 |D s |
689 | 1 | 1 | |a Matroid |0 (DE-588)4128705-8 |D s |
689 | 1 | |8 2\p |5 DE-604 | |
830 | 0 | |a Algorithms and Combinatorics |v 6 |w (DE-604)BV000617357 |9 6 | |
856 | 4 | 0 | |u https://doi.org/10.1007/978-3-662-22143-3 |x Verlag |3 Volltext |
912 | |a ZDB-2-SMA | ||
912 | |a ZDB-2-BAE | ||
940 | 1 | |q ZDB-2-SMA_Archive | |
883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-027858926 |
Datensatz im Suchindex
DE-BY-TUM_katkey | 2070518 |
---|---|
_version_ | 1821931364397613057 |
any_adam_object | |
author | Recski, András |
author_GND | (DE-588)170541177 |
author_facet | Recski, András |
author_role | aut |
author_sort | Recski, András |
author_variant | a r ar |
building | Verbundindex |
bvnumber | BV042423509 |
classification_tum | MAT 000 |
collection | ZDB-2-SMA ZDB-2-BAE |
ctrlnum | (OCoLC)864110910 (DE-599)BVBBV042423509 |
dewey-full | 511.6 |
dewey-hundreds | 500 - Natural sciences and mathematics |
dewey-ones | 511 - General principles of mathematics |
dewey-raw | 511.6 |
dewey-search | 511.6 |
dewey-sort | 3511.6 |
dewey-tens | 510 - Mathematics |
discipline | Mathematik |
doi_str_mv | 10.1007/978-3-662-22143-3 |
format | Electronic eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03348nam a2200625zcb4500</leader><controlfield tag="001">BV042423509</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20171019 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150317s1989 xx o|||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783662221433</subfield><subfield code="c">Online</subfield><subfield code="9">978-3-662-22143-3</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783662221457</subfield><subfield code="c">Print</subfield><subfield code="9">978-3-662-22145-7</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-662-22143-3</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)864110910</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042423509</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-384</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.6</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 000</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Recski, András</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)170541177</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Matroid Theory and its Applications in Electric Network Theory and in Statics</subfield><subfield code="c">by András Recski</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin, Heidelberg</subfield><subfield code="b">Springer Berlin Heidelberg</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XIII, 533 p)</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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Algorithms and Combinatorics</subfield><subfield code="v">6</subfield><subfield code="x">0937-5511</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">I. The topics of this book The concept of a matroid has been known for more than five decades. Whitney (1935) introduced it as a common generalization of graphs and matrices. In the last two decades, it has become clear how important the concept is, for the following reasons: (1) Combinatorics (or discrete mathematics) was considered by many to be a collection of interesting, sometimes deep, but mostly unrelated ideas. However, like other branches of mathematics, combinatorics also encompasses some general tools that can be learned and then applied, to various problems. Matroid theory is one of these tools. (2) Within combinatorics, the relative importance of algorithms has increased with the spread of computers. Classical analysis did not even consider problems where "only" a finite number of cases were to be studied. Now such problems are not only considered, but their complexity is often analyzed in considerable detail. Some questions of this type (for example, the determination of when the so called "greedy" algorithm is optimal) cannot even be answered without matroidal tools</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Geometry</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Topology</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Engineering mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Appl.Mathematics/Computational Methods of Engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Electrical Engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Elektrisches Netzwerk</subfield><subfield code="0">(DE-588)4014214-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Matroid</subfield><subfield code="0">(DE-588)4128705-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Statik</subfield><subfield code="0">(DE-588)4056987-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Elektrisches Netzwerk</subfield><subfield code="0">(DE-588)4014214-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Matroid</subfield><subfield code="0">(DE-588)4128705-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Statik</subfield><subfield code="0">(DE-588)4056987-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Matroid</subfield><subfield code="0">(DE-588)4128705-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Algorithms and Combinatorics</subfield><subfield code="v">6</subfield><subfield code="w">(DE-604)BV000617357</subfield><subfield code="9">6</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-3-662-22143-3</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SMA</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-BAE</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SMA_Archive</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><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\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><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027858926</subfield></datafield></record></collection> |
id | DE-604.BV042423509 |
illustrated | Not Illustrated |
indexdate | 2024-12-20T17:10:48Z |
institution | BVB |
isbn | 9783662221433 9783662221457 |
issn | 0937-5511 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027858926 |
oclc_num | 864110910 |
open_access_boolean | |
owner | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
owner_facet | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
physical | 1 Online-Ressource (XIII, 533 p) |
psigel | ZDB-2-SMA ZDB-2-BAE ZDB-2-SMA_Archive |
publishDate | 1989 |
publishDateSearch | 1989 |
publishDateSort | 1989 |
publisher | Springer Berlin Heidelberg |
record_format | marc |
series | Algorithms and Combinatorics |
series2 | Algorithms and Combinatorics |
spellingShingle | Recski, András Matroid Theory and its Applications in Electric Network Theory and in Statics Algorithms and Combinatorics Mathematics Combinatorics Geometry Topology Engineering mathematics Computer engineering Appl.Mathematics/Computational Methods of Engineering Electrical Engineering Mathematik Elektrisches Netzwerk (DE-588)4014214-0 gnd Matroid (DE-588)4128705-8 gnd Statik (DE-588)4056987-1 gnd |
subject_GND | (DE-588)4014214-0 (DE-588)4128705-8 (DE-588)4056987-1 |
title | Matroid Theory and its Applications in Electric Network Theory and in Statics |
title_auth | Matroid Theory and its Applications in Electric Network Theory and in Statics |
title_exact_search | Matroid Theory and its Applications in Electric Network Theory and in Statics |
title_full | Matroid Theory and its Applications in Electric Network Theory and in Statics by András Recski |
title_fullStr | Matroid Theory and its Applications in Electric Network Theory and in Statics by András Recski |
title_full_unstemmed | Matroid Theory and its Applications in Electric Network Theory and in Statics by András Recski |
title_short | Matroid Theory and its Applications in Electric Network Theory and in Statics |
title_sort | matroid theory and its applications in electric network theory and in statics |
topic | Mathematics Combinatorics Geometry Topology Engineering mathematics Computer engineering Appl.Mathematics/Computational Methods of Engineering Electrical Engineering Mathematik Elektrisches Netzwerk (DE-588)4014214-0 gnd Matroid (DE-588)4128705-8 gnd Statik (DE-588)4056987-1 gnd |
topic_facet | Mathematics Combinatorics Geometry Topology Engineering mathematics Computer engineering Appl.Mathematics/Computational Methods of Engineering Electrical Engineering Mathematik Elektrisches Netzwerk Matroid Statik |
url | https://doi.org/10.1007/978-3-662-22143-3 |
volume_link | (DE-604)BV000617357 |
work_keys_str_mv | AT recskiandras matroidtheoryanditsapplicationsinelectricnetworktheoryandinstatics |