A linear-time algorithm to find a separator in a graph excluding a minor (Q2930265)
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 6370604
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear-time algorithm to find a separator in a graph excluding a minor |
scientific article; zbMATH DE number 6370604 |
Statements
A linear-time algorithm to find a separator in a graph excluding a minor (English)
0 references
18 November 2014
0 references
minor graphs
0 references
separator
0 references
0.9477172493934632
0 references
0.8182992935180664
0 references
0.8116430640220642
0 references
0.8087780475616455
0 references
0.7797756791114807
0 references
