Title Details: | |
Matroids and Applications |
|
Other Titles: |
Linear Independence in Combinatorics, Graph Theory and Linear Algebra. |
Authors: |
Georgiou, Dimitrios Antoniou, Efstathios |
Reviewer: |
Soudris, Dimitrios |
Subject: | MATHEMATICS AND COMPUTER SCIENCE > MATHEMATICS > COMBINATORICS > ALGEBRAIC COMBINATORICS MATHEMATICS AND COMPUTER SCIENCE > MATHEMATICS > ORDER, LATTICES, ORDERED ALGEBRAIC STRUCTURES > ORDERED STRUCTURES |
Keywords: |
Graphs
Relations Algebraic Systems Matroids Linear Indipentancy |
Description: | |
Abstract: |
As far as Matroid theory borrows extensively from the terminology of linear algebra and graph theory we may consider it as an abstraction of various notions of central importance in these fields. Matroids have found applications in geometry, topology, combinatorial optimization, network theory and coding theory. in this section we intend to present basic ideas and theorems that formulate the matroid theory of todays.
|
Table of Contents: |
Key Definitions and Main Theorems - Matroids and Linear Algebra - Matroids and Graphs - Duality - Descendants Matroids (Minors) - Representability - Consistency - Balanced Polygons - Representability and unsigned Graphs - Types of Polarized Matroid Oriented Graphs - Matroids and Algorithms - Sections Matroids - Bibliography - Evaluation Criteria.
|
Linguistic Editors: |
Kioseoglou, Nerina Tromara, Sofia |
Technical Editors: |
Stragali, Faidra Yfantidou, Georgia |
Type: |
Chapter |
Creation Date: | 21-12-2015 |
Item Details: | |
License: |
http://creativecommons.org/licenses/by-nc-nd/3.0/gr |
Spatial Coverage: |
Without spatial coverage. |
Temporal Coverage: |
Without time coverage |
Handle | http://hdl.handle.net/11419/455 |
Bibliographic Reference: | Georgiou, D., & Antoniou, E. (2015). Matroids and Applications [Chapter]. In Georgiou, D., Antoniou, E., & Chatzimichailidis, A. 2015. Discrete Mathematical Structures in Computer Science [Undergraduate textbook]. Kallipos, Open Academic Editions. https://hdl.handle.net/11419/455 |
Language: |
Greek |
Is Part of: |
Discrete Mathematical Structures in Computer Science |
Number of pages |
17 |
Typical Learning Time: |
PT21H00M00S |
Version: |
1st Edition |
Publication Origin: |
Kallipos, Open Academic Editions |