Deriving graphs with a retracting-free bidirectional double tracing (Q5054033)
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 7624672
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Deriving graphs with a retracting-free bidirectional double tracing |
scientific article; zbMATH DE number 7624672 |
Statements
Deriving graphs with a retracting-free bidirectional double tracing (English)
0 references
29 November 2022
0 references
spanning tree
0 references
cotree
0 references
retracting-free bidirectional double tracing
0 references
0 references
0.8748224377632141
0 references
0.8515363335609436
0 references
0.83182692527771
0 references
0.8046917915344238
0 references
