The lightest totalization of an endnode labelling of a non-tree graph. I (Q2762301)
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 1687563
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The lightest totalization of an endnode labelling of a non-tree graph. I |
scientific article; zbMATH DE number 1687563 |
Statements
8 January 2002
0 references
The lightest totalization of an endnode labelling of a non-tree graph. I (English)
0 references
This first part (in Japanese) gives a partial answer to a problem fully answered in the second part [Proc. Sch. Sci. Tokai Univ. 35, 7-19 (2000; Zbl 0952.05063)] (in English).
0 references
0.8236225247383118
0 references
0.6956738233566284
0 references
