论文标题
部分可观测时空混沌系统的无模型预测
Identifying a 3-vertex strongly biconnected directed subgraph with minimum number of edges
论文作者
论文摘要
如果忽略其边缘的方向，我们的图形没有明显的图形，没有明显的图形，则强烈连接的图将是强烈的。一个3 vertex强烈双连接的图是一个强烈的双连接图形，具有删除此图中任何两个顶点的特性，留下了强烈的双连接子图。 Jaberi [11]提出了最小基数2- vertex的近似算法强烈双连接的定向子图问题。我们将重点关注多项式时间算法，这些算法我们已经为生产3个vertex的跨度子图实施了强烈的双连接。
A strongly connected graph is strongly biconnected if after ignoring the direction of its edges we have an undirected graph with no articulation points. A 3-vertex strongly biconnected graph is a strongly biconnected digraph that has the property that deleting any two vertices in this graph leaves a strongly binconnected subgraph. Jaberi [11] presented approximation algorithms for minimum cardinality 2-vertex strongly biconnected directed subgraph problem. We will focus in this paper on polynomial time algorithms which we have implemented for producing spanning subgraphs that are 3-vertex strongly biconnected.
