Linear amortized time enumeration algorithms for compatible Euler trails in edge-colored graphs (Q2687939)
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 7660686
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linear amortized time enumeration algorithms for compatible Euler trails in edge-colored graphs |
scientific article; zbMATH DE number 7660686 |
Statements
Linear amortized time enumeration algorithms for compatible Euler trails in edge-colored graphs (English)
0 references
7 March 2023
0 references
edge-colored graph
0 references
compatible Euler trail
0 references
enumeration algorithm
0 references
linear amortized time
0 references
0 references
0.8070154190063477
0 references
0.7846230864524841
0 references
0.7824427485466003
0 references
0.7787732481956482
0 references
