Search
Abstract
W pracy podajemy 3-przybliżony algorytm dla problemu spójnego przeszukiwania drzew ważonych.
Citations
-
7
CrossRef
-
0
Web of Science
-
8
Scopus
Cite as
Full text
download paper
downloaded 3 times
- Publication version
- Accepted or Published Version
- DOI:
- Digital Object Identifier (open in new tab) 10.1016/j.tcs.2012.07.006
- License
- Copyright (2012 Elsevier B.V)
Keywords
Details
- Category:
- Articles
- Type:
- artykuł w czasopiśmie wyróżnionym w JCR
- Published in:
-
THEORETICAL COMPUTER SCIENCE
no. 463,
pages 96 - 113,
ISSN: 0304-3975 - Language:
- English
- Publication year:
- 2012
- Bibliographic description:
- Dereniowski D.: Approximate search strategies for weighted trees// THEORETICAL COMPUTER SCIENCE. -Vol. 463, (2012), s.96-113
- DOI:
- Digital Object Identifier (open in new tab) 10.1016/j.tcs.2012.07.006
- Verified by:
- Gdańsk University of Technology
seen 83 times