A Class of Graphs with good Communicativeness
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)).
- Brimkov V (1991) Graph problems with local information. Talk given at the 11th European Congress on OR. Aachen 1991. Abstract booklet: 36–37Google Scholar
- Brimkov V (1992) Graph problems under incomplete information. Proc. of the Internat. Symposium on Methodology of Mathematical Modelling. Varna 1992: 253–257Google Scholar