再论网络科学中的区间图
Revisiting Interval Graphs for Network Science
摘要：
区间图的顶点表示一条实线上的区间，其中重叠的区间表示它们对应的顶点是相邻的。这意味着系统的顶点是可度量的，并且系统中存在线性结构。推广是一个图嵌入到多维欧氏空间，它被科学家用来研究生态学的多关系复杂性。然而，这项研究在20世纪80年代就过时了，当网络科学最近表示对称为多路复用的多关系网络感兴趣时，这项研究就没有再被关注。本文从网络科学的角度研究区间图。
英文摘要：
The vertices of an interval graph represent intervals over a real line where overlapping intervals denote that their corresponding vertices are adjacent. This implies that the vertices are measurable by a metric and there exists a linear structure in the system. The generalization is an embedding of a graph onto a multi-dimensional Euclidean space and it was used by scientists to study the multi-relational complexity of ecology. However the research went out of fashion in the 1980s and was not revisited when Network Science recently expressed interests with multi-relational networks known as multiplexes. This paper studies interval graphs from the perspective of Network Science.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
