Edge-orders (Q1741850)
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: Edge-orders |
scientific article; zbMATH DE number 7051768
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Edge-orders |
scientific article; zbMATH DE number 7051768 |
Statements
Edge-orders (English)
0 references
7 May 2019
0 references
The reader is assumed to be acquainted with current research on \((k,l)\)-edge-orders and st-numberings, e.g., algorithms on finite undirected graphs are studied. Transitions between such classes of mostly linear complexity are given to serve the purpose of finally obtaining efficient algorithms.
0 references
edge-order
0 references
st-edge-order
0 references
canonical ordering
0 references
edge-independent spanning tree
0 references
Mondshein sequence
0 references
non-separating ear decomposition
0 references
3-edge-connected graphs
0 references
linear time
0 references
0 references
0 references
0.84900963
0 references
0.8464453
0 references
0.84588397
0 references
0.84285986
0 references
0.8413019
0 references
0 references
0 references
