onr:"swepub:oai:DiVA.org:kth-273040"
Search: onr:"swepub:oai:DiVA.org:kth-273040" > A few methods for c...
- 1 of 1
- Previous record
- Next record
- To hitlist
A few methods for construction of feasible labeling
-
- Kryvtsun, Olena (author)
- National University «Zaporizhzhia Polytechnic», Zaporizhzhya, Ukraine
-
- Tereschenko, Elina (author)
- National University «Zaporizhzhia Polytechnic», Zaporizhzhya, Ukraine
-
- Morozovska, Kateryna, 1992- (author)
- KTH,Elektroteknisk teori och konstruktion
- (creator_code:org_t)
- 2020
- 2020
- English.
- In: Combinatorial configurations and their applications.
- Conference paper (peer-reviewed)
Abstract
Subject headings
Close
- 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.
Subject headings
- NATURVETENSKAP -- Matematik -- Diskret matematik (hsv//swe)
- NATURAL SCIENCES -- Mathematics -- Discrete Mathematics (hsv//eng)
Keyword
- feasible labeling construction; hypercube; combinatorics
- Mathematics
- Matematik
Publication and Content Type
- ref (subject category)
- kon (subject category)
To the university's database
- 1 of 1
- Previous record
- Next record
- To hitlist
Find more in SwePub
- By the author/editor
- Kryvtsun, Olena
- Tereschenko, Eli ...
- Morozovska, Kate ...
- About the subject
-
- NATURAL SCIENCES
- NATURAL SCIENCES
- and Mathematics
- and Discrete Mathema ...
- Articles in the publication
- Combinatorial co ...
- By the university
- Royal Institute of Technology
Search outside SwePub
- Extend your search to:
- Google Book Search
- Google Scholar
Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.
- Copyright © LIBRIS - National Library Systems
- LIBRIS.kb.se
