Depth-based hypergraph complexity traces from directed line graphs
作者：
Highlights：
• We aim to characterize hypergraphs in terms of structural complexity measures.
• Straightforwardly measuring the complexity of a hypergraph tends to be elusive.
• We transform a hypergraph into a line graph for measuring the complexities.
• We compute depth-based complexity traces for the hypergraph on line graphs.
• The complexity traces provide a flexible framework for hypergraphs and graphs.
摘要
Highlights•We aim to characterize hypergraphs in terms of structural complexity measures.•Straightforwardly measuring the complexity of a hypergraph tends to be elusive.•We transform a hypergraph into a line graph for measuring the complexities.•We compute depth-based complexity traces for the hypergraph on line graphs.•The complexity traces provide a flexible framework for hypergraphs and graphs.
论文关键词：Hypergraphs,Directed line graphs,Entropies,Centroid vertex,Depth-based complexity traces
论文评审过程：Received 15 November 2015, Accepted 7 January 2016, Available online 18 January 2016, Version of Record 27 February 2016.
论文官网地址：https://doi.org/10.1016/j.patcog.2016.01.004
