Finding the shortest path for a Hypergraph
Keyword(s):
A hypergraph is given by [Formula: see text], where [Formula: see text] is a set of vertices and [Formula: see text] is a set of nonempty subsets of [Formula: see text], the member of [Formula: see text] is named hyperedge. So, a hypergraph is a nature generalization of a graph. A hypergraph has a complex structure, thus some researchers try to transform a hypergraph to a graph. In this paper, we define two graphs, Clique graph and Persian graph. These relations are one to one. We can find the shortest path between two vertices in a hypergraph [Formula: see text], by using the Dijkstra algorithm in graph theory on the graphs corresponding to [Formula: see text].
1993 ◽
Vol 2
(1)
◽
pp. 47-75
◽
Keyword(s):
Keyword(s):
2009 ◽
Vol 419-420
◽
pp. 557-560
◽
2017 ◽
Vol 27
(1)
◽
pp. 133-155
◽
Keyword(s):
2014 ◽
Vol 915-916
◽
pp. 1296-1299
2012 ◽
Vol 532-533
◽
pp. 1775-1779
Keyword(s):
2012 ◽
Vol 433-440
◽
pp. 6345-6349
Keyword(s):