Testing Bandwidth <i>k</i> for <i>k</i>-Connected Graphs (Q4443087)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Testing Bandwidth k for k-Connected Graphs |
scientific article; zbMATH DE number 2024367
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Testing Bandwidth <i>k</i> for <i>k</i>-Connected Graphs |
scientific article; zbMATH DE number 2024367 |
Statements
Testing Bandwidth <i>k</i> for <i>k</i>-Connected Graphs (English)
0 references
8 January 2004
0 references
bandwidth
0 references
bandwidth-\(k\) graph
0 references
\(k\)-connected graph
0 references
linear-time algorithm
0 references
linear layout
0 references
start sequence
0 references
