CSpace

Browse/Search Results:  1-10 of 11 Help

Selected(0)Clear Items/Page:    Sort:
DISAGREEMENT OF HIERARCHICAL OPINION DYNAMICS WITH CHANGING ANTAGONISMS 期刊论文
SIAM JOURNAL ON CONTROL AND OPTIMIZATION, 2019, 卷号: 57, 期号: 1, 页码: 718-742
Authors:  Meng, Deyuan;  Meng, Ziyang;  Hong, Yiguang
Favorite  |  View/Download:87/0  |  Submit date:2020/01/10
disagreement analysis  opinion dynamics  antagonistic interaction  leader-follower hierarchy  switching signed digraph  
3-Restricted arc connectivity of digraphs 期刊论文
DISCRETE MATHEMATICS, 2017, 卷号: 340, 期号: 10, 页码: 2341-2348
Authors:  Lin, Shangwei;  Jin, Ya'nan;  Li, Chunfang
Favorite  |  View/Download:83/0  |  Submit date:2018/07/30
Network  Digraph  Connectivity  Minimum degree  
A Polyhedral Description of Kernels 期刊论文
MATHEMATICS OF OPERATIONS RESEARCH, 2016, 卷号: 41, 期号: 3, 页码: 969-990
Authors:  Chen, Qin;  Chen, Xujin;  Zang, Wenan
Favorite  |  View/Download:74/0  |  Submit date:2018/07/30
digraph  kernel  polytope  algorithm  complexity  
Semi-global output consensus of a group of linear systems in the presence of external disturbances and actuator saturation: An output regulation approach 期刊论文
INTERNATIONAL JOURNAL OF ROBUST AND NONLINEAR CONTROL, 2016, 卷号: 26, 期号: 7, 页码: 1353-1375
Authors:  Zhao, Zhiyun;  Hong, Yiguang;  Lin, Zongli
Favorite  |  View/Download:65/0  |  Submit date:2018/07/30
Output regulation  output consensus  actuator saturation  multi-agent systems  low-gain feedback  external disturbance  jointly connected graph  
Neighborhood unions and cyclability of graphs 期刊论文
DISCRETE APPLIED MATHEMATICS, 2004, 卷号: 140, 期号: 1-3, 页码: 91-101
Authors:  Liu, HQ;  Lu, M;  Tian, F
Favorite  |  View/Download:47/0  |  Submit date:2018/07/30
Hamiltonian cycle  pushed operation  cyclable graph  digraph  
Minimum k arborescences with bandwidth constraints 期刊论文
ALGORITHMICA, 2004, 卷号: 38, 期号: 4, 页码: 529-537
Authors:  Cai, MC;  Deng, XT;  Wang, LS
Favorite  |  View/Download:62/0  |  Submit date:2018/07/30
digraph  arborescence  matroid  polymatroid  polymatroid intersection  maximum flow  algorithm and complexity  
On connectivity of consecutive-d digraphs 期刊论文
DISCRETE MATHEMATICS, 2002, 卷号: 257, 期号: 2-3, 页码: 371-384
Authors:  Du, DZ;  Hsu, DF;  Ngo, HQ;  Peck, GW
Favorite  |  View/Download:54/0  |  Submit date:2018/07/30
consecutive-d digraphs  connectivity  interconnection networks  
Vertices of degree k in a minimally k-edge-connected digraph 期刊论文
DISCRETE MATHEMATICS, 2000, 卷号: 218, 期号: 1-3, 页码: 293-298
Authors:  Yuan, XD;  Cai, MC
Favorite  |  View/Download:30/0  |  Submit date:2018/07/30
digraph  indegree  outdegree  k-edge-connected  k-cut  crossing-free  terminal  
The number of vertices of degree k in a minimally k-edge-connected digraph 期刊论文
JOURNAL OF GRAPH THEORY, 2000, 卷号: 33, 期号: 2, 页码: 94-108
Authors:  Yuan, XD;  Kang, LY;  Cai, MC
Favorite  |  View/Download:37/0  |  Submit date:2018/07/30
k-edge-connected  degree  tree representation  
Super line-connectivity of consecutive-d digraphs 期刊论文
DISCRETE MATHEMATICS, 1998, 卷号: 183, 期号: 1-3, 页码: 27-38
Authors:  Cao, F;  Du, DZ;  Hsu, DF;  Hwang, LH;  Wu, WL
Favorite  |  View/Download:46/0  |  Submit date:2018/07/30