Abstract
We propose online algorithms for solving the well known Path Problem (PP) for searching a path from arbitrary graph vertex to another one in environment of incomplete information. The algorithms work on the introduced below convex graphs. The PP is one of the most intensively explored motion planning problems within the amortized analysis that evaluates the online algorithms with respect to the quality of the solution produced by them (e.g. see Tarjan (1985)).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Brimkov V (1991) Graph problems with local information. Talk given at the 11th European Congress on OR. Aachen 1991. Abstract booklet: 36–37
Brimkov V (1992) Graph problems under incomplete information. Proc. of the Internat. Symposium on Methodology of Mathematical Modelling. Varna 1992: 253–257
Tarjan R (1985) Amortized computational complexity. SIAM J. Alg. Disc. Meth. 6 No 2: 306–318
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brimkov, V.E. (1993). A Class of Graphs with good Communicativeness. In: Karmann, A., Mosler, K., Schader, M., Uebe, G. (eds) Operations Research ’92. Physica, Heidelberg. https://doi.org/10.1007/978-3-662-12629-5_30
Download citation
DOI: https://doi.org/10.1007/978-3-662-12629-5_30
Publisher Name: Physica, Heidelberg
Print ISBN: 978-3-7908-0679-3
Online ISBN: 978-3-662-12629-5
eBook Packages: Springer Book Archive