Minimal k-arc Connected Graph.

机译：最小k弧连通图。

获取原文

页面导航

摘要
著录项
相似文献
相关主题

摘要

A graph is k-arc-connected if it is necessary to remove at least k arcs in order to disconnect the graph. The paper solves the problem of determining the least number of arcs required in a k-arc-connected graph on n nodes by describing constructions that produce such graphs having kn/2 arcs (for kn even) or (kn+1)/2 arcs (for kn odd). These results have application to the practical problem of synthesizing minimum cost, k-reliable communication networks. (Author)

著录项

作者
Fulkerson, D. R.; Shapley, L. S.;
展开▼
作者单位

展开▼
年度 1971
页码 1-15
总页数 15
原文格式 PDF
正文语种 eng
中图分类
关键词
Topology; Graphics; Set theory; Communication systems; Networks; Mathematical models; Graph theory;

机译：拓扑;图形;集合论;通信系统;网络;数学模型;图论;

相似文献

外文文献
中文文献
专利

1. ON THE STRUCTURE OF A 3-CONNECTED GRAPH. 2 [J] . D. V. Karpov Journal of Mathematical Sciences . 2020,第3期

机译：在3连接图的结构上。 2
2. Surface diffeomorphisms with connected but not path-connected minimal sets containing arcs [J] . Hiromichi Nakayama Journal of the Mathematical Society of Japan . 2017,第1期

机译：具有连接但不包含路径的最小集的包含圆弧的表面微分
3. On minimally k-edge-connected graphs and shortest k-edge-connected Steiner networks [J] . Tibor Jordan Discrete Applied Mathematics . 2003,第2期

机译：在最小k边连接图和最短k边连接的Steiner网络上
4. A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem [C] . Bundit Laekhanukit, Shayan Oveis Gharan, Mohit Singh International Colloquium on Automata, Languages, and Programming . 2012

机译：通过采样方法对最小尺寸K弧连接的子图问题进行舍入
5. Approaches to approximating the minimum weight k-edge connected spanning subgraph of a mixed graph. [D] . Scheder, Dominik Alban. 2005

机译：逼近混合图的最小权重k边连接的跨子图的方法。
6. Degree sequence for k-arc strongly connected multiple digraphs [O] . Yanmei Hong, Qinghai Liu -1

机译：k弧强连通多个有向图的度数序列
7. Degree sequence for k-arc strongly connected multiple digraphs [O] . Yanmei Hong, Qinghai Liu 2017

机译：k-arc的度序列强连接多个有向图

Minimal k-arc Connected Graph.

摘要

著录项

相似文献

相关主题

期刊订阅