FBD-graphs
收藏DataCite Commons2025-02-19 更新2025-04-16 收录
下载链接：
https://repository.tugraz.at/doi/10.3217/szw62-e9g80
下载链接
链接失效反馈官方服务：
资源简介：
Three different FBD-Graphs (fully blocked digraphs without oriented 1-, 2-, or 3-cycles), saved as an edgelist.
`FBD_original.txt` contains to the full construction which is described in full-detail in the paper.
`FBD_minimal_vertices.tex` is 6 vertices and 48 edges smaller, at the time of writing the smallest known FBD-graph w.r.t. number of vertices and edges.
`FBD_minimal_α.txt` describes our smallest known graph w.r.t. max-α, i.e. the biggest number of 3-cliques a single edge participates in. In this case α=34.
`verifier.py` contains self-explanatory python code to check a graph for FBD-properties. Please fetch graph data files manually if autofetching does not work.
三种不同的FBD图（FBD-Graphs，即无定向1-、2-或3-环的完全阻塞有向图），以边列表形式存储。
`FBD_original.txt`包含论文中详细描述的完整构造。
`FBD_minimal_vertices.tex`比前者少6个顶点和48条边，是撰写本文时已知的顶点数和边数最少的FBD图。
`FBD_minimal_α.txt`描述了我们已知的max-α最小的图，其中max-α指单条边参与的3-团的最大数量。本图中α=34。
`verifier.py`包含易于理解的Python代码，用于检查图是否具有FBD属性。如果自动获取失败，请手动获取图数据文件。
提供机构：
Graz University of Technology
创建时间：
2025-02-19
