Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Fast collaborative graph exploration
Dereniowski D., Disser Y., Kosowski A., Pajak D., Uznański P. Information and Computation243 (C):37-49,2015.Type:Article
Date Reviewed: Sep 1 2015

Online graph exploration often requires one of the exploring agents to visit each vertex. The authors define and analyze such exploration for an undirected graph in the least numbers of steps for a multi-collaborating-agent scenario. The problem has been modeled as the traveling salesmen problem of operations research. Also, the authors consider the issue of communication between the agents, calling their problem tree exploration with global communications (TEG). The paper suggests a mathematical procedure to solve TEG. This very formal analytical study revolves around a set of mathematical entities (procedures, definitions, lemma, and theorems) and their definitions, and proof as applicable. The paper claims that the procedure/strategy gives results in finite numbers of steps within calculable bounds in an environment where agents can exchange information completely.

The paper lists 22 references. It would interest researchers in applied mathematics and information science.

Reviewer:  Anoop Malaviya Review #: CR143737 (1511-0970)
Bookmark and Share
  Reviewer Selected
 
 
Graph Theory (G.2.2 )
 
 
Graph And Tree Search Strategies (I.2.8 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Graph Theory": Date
Graphs and algorithms
Gondran M., Minoux M. (ed), Vajda S., John Wiley & Sons, Inc., New York, NY, 1984. Type: Book (9789780471103745)
Jan 1 1985
On graph rewritings
Raoult J. Theoretical Computer Science 32(1-2): 1-24, 1984. Type: Article
Sep 1 1985
Non-partitionable point sets
Avis D. Information Processing Letters 19(3): 125-129, 1984. Type: Article
Jul 1 1985
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy