Making Graph Theory Algorithms Accessible to Blind Students
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14750%2F14%3A00080101" target="_blank" >RIV/00216224:14750/14:00080101 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Making Graph Theory Algorithms Accessible to Blind Students
Original language description
How can blind people use a given mathematical algorithm in view of the fact that they follow all the information in linear way only? The goal is to find the optimal set of methods which would respect blind people's linear manner of working and the same time be sufficiently effective.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
AM - Pedagogy and education
OECD FORD branch
—
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Lecture Notes in Computer Science
ISSN
0302-9743
e-ISSN
—
Volume of the periodical
2014
Issue of the periodical within the volume
8547
Country of publishing house
DE - GERMANY
Number of pages
8
Pages from-to
549-556
UT code for WoS article
—
EID of the result in the Scopus database
—