首页> 外文OA文献 >Strongly Connected Spanning Subgraphs with the Minimum Number of Arcs in Quasi-transitive Digraphs

【2h】

Strongly Connected Spanning Subgraphs with the Minimum Number of Arcs in Quasi-transitive Digraphs

机译：拟传递有向图中极小弧数的强连通跨越子图

页面导航

著录项
相似文献
相关主题

著录项

作者
Bang-Jensen J.; Huang J.; Yeo Anders;
展开▼
作者单位

展开▼
年度 2003
总页数
原文格式 PDF
正文语种 eng
中图分类

相似文献

外文文献
中文文献
专利

1. STRONGLY CONNECTED SPANNING SUBDIGRAPHS WITH THE MINIMUM NUMBER OF ARCS IN QUASI-TRANSITIVE DIGRAPHS [J] . JORGEN BANG-JENSEN, JING HUANG, ANDERS YEO SIAM Journal on Discrete Mathematics . 2003,第2期

机译：拟过渡图中具有最小ARCS数的强连通展开子图
2. Edge-disjoint minimum-weight connected spanning k-edge subgraphs in a weighted graph: A connectedness theorem [J] . Xueliang Li Discrete mathematics . 1998,第1a3期

机译：加权图中边缘不相交的最小权重连接的跨k边子图：连通性定理
3. Edge-disjoint minimum-weight connected spanning k-edge subgraphs in a weighted graph: A connectedness theorem [J] . Xueliang Li Discrete mathematics . 1998,第1a3期

机译：加权图中边缘不相交的最小权重连接的跨k边子图：连通性定理
4. The Partial Inverse Minimum Connected Spanning Subgraph Problem with Given Cyclomatic Number [C] . Zheheng Ding, Fang Zhu, Qin Wang International Conference on Opto-Electronics Engineering and Materials Research . 2013

机译：具有给定圈数的局部逆最小最小跨越跨越子图问题
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. Approximating Minimum-Size 2-Edge-Connected and 2-Vertex-Connected Spanning Subgraphs [O] . Narayan Vishnu Verambudi 2017

机译：近似最小尺寸的2边连接和2边连接的跨子图

Strongly Connected Spanning Subgraphs with the Minimum Number of Arcs in Quasi-transitive Digraphs

著录项

相似文献

相关主题

期刊订阅