Arborescence polytopes for series-parallel graphs (Q1329787)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 612413
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Arborescence polytopes for series-parallel graphs |
scientific article; zbMATH DE number 612413 |
Statements
Arborescence polytopes for series-parallel graphs (English)
0 references
1 December 1994
0 references
A graph is called series-parallel if it does not contain any subgraph homeomorphic to the complete graph on 4 vertices. For a directed graph whose underlying graph is series-parallel, an \(r\)-arborescence is defined as a tree directed away from the root vertex \(r\). Given a set of terminals, a Steiner arborescence is an \(r\)-arborescence spanning this set. Associated with these arborescences the author defines the convex hulls of incidence vectors and characterizes these polytopes completely by linear inequalities.
0 references
series-parallel graphs
0 references
discrete graph
0 references
arborescence
0 references
polytopes
0 references
linear inequalities
0 references
0.7865663766860962
0 references
0.7861092686653137
0 references
0.7586758136749268
0 references
0.7541081309318542
0 references
0.7537314891815186
0 references
