Graph Traversal Task

A graph traversal task is a search task that requires the searching for a Graph Pattern in a graph.

• AKA: Subgraph Search.
  • Input:
    • a Target Graph.
    • a Graph Pattern.
  • output:
    • one or more Subgraphs.
  • It can range from being an Exact Graph Search Task to being an Approximate Graph Search Task (that includes a Graph Node Similarity Function and/or Graph Edge Similarity Function).
  • It can be solved by a Graph Search System that implements of a Graph Search Algorithm.
  • It can range from being a Bipartite Graph Search Task to being a General Graph Search Task.
  • …
• Example(s):
  • a Graph Matching Task.
  • a Tree Traversal Task.
• See: String Search Task.

---

---

References

2015

• (Wikipedia, 2015) ⇒ http://en.wikipedia.org/wiki/graph_traversal Retrieved:2015-5-10.
  • In computer science, graph traversal is the problem of visiting all the nodes in a graph in a particular manner, updating and/or checking their values along the way. Tree traversal is a special case of graph traversal.

---