Sökning: onr:"swepub:oai:DiVA.org:kth-273040" >
A few methods for c...
A few methods for construction of feasible labeling
-
- Kryvtsun, Olena (författare)
- National University «Zaporizhzhia Polytechnic», Zaporizhzhya, Ukraine
-
- Tereschenko, Elina (författare)
- National University «Zaporizhzhia Polytechnic», Zaporizhzhya, Ukraine
-
- Morozovska, Kateryna, 1992- (författare)
- KTH,Elektroteknisk teori och konstruktion
-
(creator_code:org_t)
- 2020
- 2020
- Engelska.
-
Ingår i: Combinatorial configurations and their applications.
- Relaterad länk:
-
https://kth.diva-por... (primary) (Raw object)
-
visa fler...
-
https://urn.kb.se/re...
-
visa färre...
Abstract
Ämnesord
Stäng
- Approximate algorithms for constructing a minimum feasible labeling for a tree are considered based on a greedy approach, combined with a breadth-first search and depth-first search.
Ämnesord
- NATURVETENSKAP -- Matematik -- Diskret matematik (hsv//swe)
- NATURAL SCIENCES -- Mathematics -- Discrete Mathematics (hsv//eng)
Nyckelord
- feasible labeling construction; hypercube; combinatorics
- Mathematics
- Matematik
Publikations- och innehållstyp
- ref (ämneskategori)
- kon (ämneskategori)