Width parameters of graphs and matroids
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F05%3A00012174" target="_blank" >RIV/61989100:27240/05:00012174 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Width parameters of graphs and matroids
Original language description
We will review some known "width" parameters of graphs, and relate them to matroids. In particular, we use matroids to introduce a vertex-free definition of graph tree-width, and we show how matroid branch-width is related with decidability of MSO theories of both matroids and graphs (cf. rank-width).
Czech name
Width parameters of graphs and matroids
Czech description
We will review some known "width" parameters of graphs, and relate them to matroids. In particular, we use matroids to introduce a vertex-free definition of graph tree-width, and we show how matroid branch-width is related with decidability of MSO theories of both matroids and graphs (cf. rank-width).
Classification
Type
D - Article in proceedings
CEP classification
BD - Information theory
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA201%2F05%2F0050" target="_blank" >GA201/05/0050: Structural properties and algorithmic complexity of discrete problems</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2005
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Exact Algorithms and Fixed-Parameter Tractability
ISBN
1862 - 4405
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
6-12
Publisher name
Dagstuhl
Place of publication
Wadern
Event location
Dagstuhl, Germany
Event date
Jul 23, 2005
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—