Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
12 | Dong Liu, Pingshan Li, Bicheng Zhang |
Component edge connectivity of hypercube-like networks. |
Theor. Comput. Sci. |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Rui Zhu, Xue-Qian Zeng, Xiang-Jun Li, Meijie Ma |
Reliability of arrangement networks in terms of the h-restricted edge connectivity. |
J. Parallel Distributed Comput. |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Chao Liao, Qingyun Chen, Bundit Laekhanukit, Yuhao Zhang 0001 |
Almost Tight Approximation Hardness for Single-Source Directed k-Edge-Connectivity. |
CoRR |
2022 |
DBLP BibTeX RDF |
|
12 | Ruoxu Cen, Jason Li 0006, Debmalya Panigrahi |
Edge Connectivity Augmentation in Near-Linear Time. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Mohit Garg 0003, Fabrizio Grandoni 0001, Afrouz Jabal Ameli |
Improved Approximation for Two-Edge-Connectivity. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Lijun Chang, Zhiyi Wang |
A Near-Optimal Approach to Edge Connectivity-Based Hierarchical Graph Decomposition. (PDF / PS) |
Proc. VLDB Endow. |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Pingshan Li, Rong Liu, Xianglin Liu |
The (E)FTSM-(edge) Connectivity of Cayley Graphs Generated by Transposition Trees. |
Int. J. Found. Comput. Sci. |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Zhengqin Yu, Shuming Zhou, Hong Zhang |
Fault-Tolerant Strong Menger (Edge) Connectivity of DCC Linear Congruential Graphs. |
Int. J. Found. Comput. Sci. |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Xiaoqing Liu, Shuming Zhou, Hong Zhang, Baohua Niu |
The Component (Edge) Connectivity of Round Matching Composition Networks. |
Int. J. Found. Comput. Sci. |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Lakshmi Satya Vani Narayanam, Satish V. Motammanavar |
On computing Banzhaf power index for k-edge connectivity in graphs. |
Soc. Netw. Anal. Min. |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Yuefang Sun, Chenchen Wu, Xiaoyan Zhang 0001, Zhao Zhang 0002 |
Computation and algorithm for the minimum k-edge-connectivity of graphs. |
J. Comb. Optim. |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Michael A. Henning, Anders Yeo |
A complete description of convex sets associated with matchings and edge-connectivity in graphs. |
J. Graph Theory |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Ruoxu Cen, Jason Li 0006, Debmalya Panigrahi |
Augmenting Edge Connectivity via Isolating Cuts. |
SODA |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Chao Liao, Qingyun Chen, Bundit Laekhanukit, Yuhao Zhang 0001 |
Almost Tight Approximation Hardness for Single-Source Directed k-Edge-Connectivity. |
ICALP |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Ruoxu Cen, Jason Li 0006, Debmalya Panigrahi |
Edge connectivity augmentation in near-linear time. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Xuemei Liu, Jixiang Meng |
The k-restricted edge-connectivity of the data center network DCell. |
Appl. Math. Comput. |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Yulong Wei, Ronghua Li, Weihua Yang |
The g-Extra Edge-Connectivity of Balanced Hypercubes. |
J. Interconnect. Networks |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Miaomiao Zhuo, Qinqin Li, Baoyindureng Wu, Xinhui An |
Average Edge-Connectivity of Cubic Graphs. |
J. Interconnect. Networks |
2021 |
DBLP DOI BibTeX RDF |
|
12 | J. B. Saraf, Y. M. Borse |
A Note on Conditional Edge Connectivity of Hypercube Networks. |
J. Interconnect. Networks |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Sinan G. Aksoy, Mark Kempton, Stephen J. Young |
Spectral Threshold for Extremal Cyclic Edge-Connectivity. |
Graphs Comb. |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Jesús Leaños, Christophe Ndjatchi |
The Edge-Connectivity of Token Graphs. |
Graphs Comb. |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Ruoxu Cen, Jason Li 0006, Debmalya Panigrahi |
Augmenting Edge Connectivity via Isolating Cuts. |
CoRR |
2021 |
DBLP BibTeX RDF |
|
12 | Dong Liu, Pingshan Li, Bicheng Zhang |
Component Edge Connectivity of Hypercube-like Networks. |
CoRR |
2021 |
DBLP BibTeX RDF |
|
12 | Naoki Matsumoto, Tomoki Nakamigawa |
Game edge-connectivity of graphs. |
Discret. Appl. Math. |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Michael A. Henning, Anders Yeo |
Matching and edge-connectivity in graphs with given maximum degree. |
Discret. Math. |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Parinya Chalermsook, Syamantak Das, Yunbum Kook, Bundit Laekhanukit, Yang P. Liu, Richard Peng, Mark Sellke, Daniel Vaz 0001 |
Vertex Sparsification for Edge Connectivity. |
SODA |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Wenyu Jin 0001, Xiaorui Sun |
Fully Dynamic s-t Edge Connectivity in Subpolynomial Time (Extended Abstract). |
FOCS |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Loukas Georgiadis, Dionysios Kefallinos, Luigi Laura, Nikos Parotsidis |
An Experimental Study of Algorithms for Computing the Edge Connectivity of a Directed Graph. |
ALENEX |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Thatchaphol Saranurak |
A Simple Deterministic Algorithm for Edge Connectivity. |
SOSA |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Marika Arimoto, Junichi Hara, Hiroshi Watanabe |
An Image Inpainting Method Considering Edge Connectivity of Defects. |
GCCE |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Zhihong He, Mei Lu |
Super edge-connectivity and zeroth-order Randiæ index. |
Discuss. Math. Graph Theory |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Liyang Zhai, Liqiong Xu, Weihua Yang |
Fault-Tolerant Maximal Local-Edge-Connectivity of Augmented Cubes. |
Parallel Process. Lett. |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Hao Li 0061, Hui Zhang 0041 |
On the Edge-Connectivity of an Uncertain Random Graph. |
IEEE Access |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Keren Censor-Hillel, Michal Dory |
Fast distributed approximation for TAP and 2-edge-connectivity. |
Distributed Comput. |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Tongtong Ding, Pingshan Li, Min Xu 0005 |
The component (edge) connectivity of shuffle-cubes. |
Theor. Comput. Sci. |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Blessings T. Fundikwa, Jaya Percival Mazorodze, Simon Mukwembi |
Upper Bounds on the Diameter of Bipartite and Triangle-Free Graphs with Prescribed Edge Connectivity. |
Int. J. Math. Math. Sci. |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Rongquan Feng, Wenqian Zhang |
The Edge-Connectivity of Strongly 3-Walk-Regular Graphs. |
Graphs Comb. |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Christian Elbracht, Jan Kurkofka, Maximilian Teegen |
Edge-connectivity and tree-structure in finite and infinite graphs. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
12 | Simon Apers, Troy Lee |
Quantum query complexity of edge connectivity. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
12 | Thatchaphol Saranurak |
A Simple Deterministic Algorithm for Edge Connectivity. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
12 | Yang P. Liu |
Vertex Sparsification for Edge Connectivity in Polynomial Time. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
12 | Yung H. Tsin |
A simple certifying algorithm for 3-edge-connectivity. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
12 | Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit, Yunbum Kook, Yang P. Liu, Richard Peng, Mark Sellke, Daniel Vaz 0001 |
Vertex Sparsification for Edge Connectivity. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
12 | Wenyu Jin 0001, Xiaorui Sun |
Fully Dynamic c-Edge Connectivity in Subpolynomial Time. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
12 | Pingshan Li, Min Xu 0005 |
Fault-tolerant strong Menger (edge) connectivity of arrangement graph. |
Discret. Appl. Math. |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Tianlong Ma, Jinling Wang 0002, Mingzu Zhang, Xiaodong Liang |
Path 3-(edge-)connectivity of lexicographic product graphs. |
Discret. Appl. Math. |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Monika Henzinger, Satish Rao, Di Wang 0005 |
Local Flow Partitioning for Faster Edge Connectivity. |
SIAM J. Comput. |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Mohsen Ghaffari 0001, Krzysztof Nowicki 0002, Mikkel Thorup |
Faster Algorithms for Edge Connectivity via Random 2-Out Contractions. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Xava Grooms, Corey E. Baker |
Optimizing Edge Connectivity Post Natural Disaster using UAVs. |
HotMobile |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Onur Ugurlu, Vahid Khalilpour Akram, Deniz Türsel Eliiyi |
A Distributed Depth First Search based Algorithm for Edge Connectivity Estimation. |
CNSM |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Thomas Erlebach, Jakob T. Spooner |
A Game of Cops and Robbers on Graphs with Periodic Edge-Connectivity. |
SOFSEM |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Alicia Esquivel Morel, Deniz Kavzak Ufuktepe, Robert Ignatowicz, Alexander Riddle, Chengyi Qu, Prasad Calyam, Kannappan Palaniappan |
Enhancing Network-edge Connectivity and Computation Security in Drone Video Analytics. |
AIPR |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Nastaran Haghparast, Dariush Kiani |
Edge-connectivity and edges of even factors of graphs. |
Discuss. Math. Graph Theory |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Tianlong Ma, Jinling Wang 0002, Mingzu Zhang |
The Restricted Edge-Connectivity of Kronecker Product Graphs. |
Parallel Process. Lett. |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Huazhong Lü, Tingzeng Wu |
Super edge-connectivity and matching preclusion of data center networks. |
Discret. Math. Theor. Comput. Sci. |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Camino Balbuena, Xavier Marcote |
The p-restricted edge-connectivity of Kneser graphs. |
Appl. Math. Comput. |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Satoshi Taoka, Toshimasa Watanabe |
Efficient Algorithms to Augment the Edge-Connectivity of Specified Vertices by One in a Graph. |
IEICE Trans. Fundam. Electron. Commun. Comput. Sci. |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Ken-ichi Kawarabayashi, Mikkel Thorup |
Deterministic Edge Connectivity in Near-Linear Time. |
J. ACM |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Wenqian Zhang |
The Cyclic Edge-Connectivity of Strongly Regular Graphs. |
Graphs Comb. |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Mohit Daga, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak |
Distributed Edge Connectivity in Sublinear Time. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
12 | Thomas Erlebach, Jakob T. Spooner |
A Game of Cops and Robbers on Graphs with Periodic Edge-Connectivity. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
12 | Yuefang Sun, Xiaoyan Zhang 0001, Zhao Zhang |
Extremality and Sharp Bounds for the k-edge-connectivity of Graphs. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
12 | Mohsen Ghaffari 0001, Krzysztof Nowicki 0002, Mikkel Thorup |
Faster Algorithms for Edge Connectivity via Random 2-Out Contractions. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
12 | Yang P. Liu, Richard Peng, Mark Sellke |
Vertex Sparsifiers for c-Edge Connectivity. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
12 | Alexandr Andoni, Clifford Stein 0001, Peilin Zhong |
Log Diameter Rounds Algorithms for 2-Vertex and 2-Edge Connectivity. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
12 | Alexandr Andoni, Clifford Stein 0001, Peilin Zhong |
Log Diameter Rounds Algorithms for 2-Vertex and 2-Edge Connectivity. |
ICALP |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Rahul Raj Gupta, Sushanta Karmakar |
Incremental Algorithm for Minimum Cut and Edge Connectivity in Hypergraph. |
IWOCA |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Mohit Daga, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak |
Distributed edge connectivity in sublinear time. |
STOC |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Michael Stiebitz, Bjarne Toft |
A Brooks Type Theorem for the Maximum Local Edge Connectivity. |
Electron. J. Comb. |
2018 |
DBLP DOI BibTeX RDF |
|
12 | Litao Guo, Bernard L. S. Lin |
Restricted edge connectivity of graphs on degree. |
J. Intell. Fuzzy Syst. |
2018 |
DBLP DOI BibTeX RDF |
|
12 | Gülnaz Boruzanli Ekinci, Alpay Kirlangic |
The super edge connectivity of Kronecker product graphs. |
RAIRO Oper. Res. |
2018 |
DBLP DOI BibTeX RDF |
|
12 | Mingzu Zhang, Lianzhu Zhang, Xing Feng, Hong-Jian Lai |
An O(log2(N)) Algorithm for Reliability Evaluation of h-Extra Edge-Connectivity of Folded Hypercubes. |
IEEE Trans. Reliab. |
2018 |
DBLP DOI BibTeX RDF |
|
12 | Satoshi Taoka, Tadachika Oki, Toshiya Mashima, Toshimasa Watanabe |
Reduction of Constraints from Multipartition to Bipartition in Augmenting Edge-Connectivity of a Graph by One. |
IEICE Trans. Fundam. Electron. Commun. Comput. Sci. |
2018 |
DBLP DOI BibTeX RDF |
|
12 | Huazhong Lü, Tingzeng Wu |
Super edge-connectivity and matching preclusion of data center networks. |
CoRR |
2018 |
DBLP BibTeX RDF |
|
12 | Huiwen Cheng, Xiaoxia Ma, Xiaojing Du |
Super edge connectivity of direct product of graphs. |
Ars Comb. |
2018 |
DBLP BibTeX RDF |
|
12 | Shuli Zhao, Weihua Yang, Shurong Zhang, Liqiong Xu |
Component Edge Connectivity of Hypercubes. |
Int. J. Found. Comput. Sci. |
2018 |
DBLP DOI BibTeX RDF |
|
12 | Huiqiu Lin, Weihua Yang |
A conditional edge connectivity of double-orbit networks. |
Future Gener. Comput. Syst. |
2018 |
DBLP DOI BibTeX RDF |
|
12 | Yehong Shao |
Essential edge connectivity of line graphs. |
Discret. Math. |
2018 |
DBLP DOI BibTeX RDF |
|
12 | Rajaguru Dayalan, Puviyarasi T., T. Vengattaraman |
A Review on Edge Connectivity Framework for Handheld Computing. |
IJHCR |
2017 |
DBLP DOI BibTeX RDF |
|
12 | Yuefang Sun |
A sharp lower bound for generalized 3-edge-connectivity of strong product graphs. |
Discuss. Math. Graph Theory |
2017 |
DBLP DOI BibTeX RDF |
|
12 | Zhao Wang, Yaping Mao, Chengfu Ye, Haixing Zhao |
Super Edge-Connectivity of Strong Product Graphs. |
J. Interconnect. Networks |
2017 |
DBLP DOI BibTeX RDF |
|
12 | Kurt Mehlhorn, Adrian Neumann, Jens M. Schmidt |
Certifying 3-Edge-Connectivity. |
Algorithmica |
2017 |
DBLP DOI BibTeX RDF |
|
12 | Luis Pedro Montejano 0001, Ignasi Sau |
On the complexity of computing the k-restricted edge-connectivity of a graph. |
Theor. Comput. Sci. |
2017 |
DBLP DOI BibTeX RDF |
|
12 | Lijun Chang |
A Near-optimal Algorithm for Edge Connectivity-based Hierarchical Graph Decomposition. |
CoRR |
2017 |
DBLP BibTeX RDF |
|
12 | Monika Henzinger, Satish Rao, Di Wang 0005 |
Local Flow Partitioning for Faster Edge Connectivity. |
CoRR |
2017 |
DBLP BibTeX RDF |
|
12 | Keren Censor-Hillel, Michal Dory |
Fast Distributed Approximation for TAP and 2-Edge-Connectivity. |
CoRR |
2017 |
DBLP BibTeX RDF |
|
12 | Shumin Zhang |
On the path edge-connectivity of graphs. |
Ars Comb. |
2017 |
DBLP BibTeX RDF |
|
12 | Dingjun Lou |
A Square Time Algorithm for Cyclic Edge Connectivity of Planar Graphs. |
Ars Comb. |
2017 |
DBLP BibTeX RDF |
|
12 | Hongliang Lu, Yuqing Lin |
On the number of disjoint perfect matchings of regular graphs with given edge connectivity. |
Discret. Math. |
2017 |
DBLP DOI BibTeX RDF |
|
12 | Monika Henzinger, Satish Rao, Di Wang 0005 |
Local Flow Partitioning for Faster Edge Connectivity. |
SODA |
2017 |
DBLP DOI BibTeX RDF |
|
12 | Jun-Wei Hsieh |
Suspected vehicle detection for driving without license plate using symmelets and edge connectivity. |
AVSS |
2017 |
DBLP DOI BibTeX RDF |
|
12 | Keren Censor-Hillel, Michal Dory |
Fast Distributed Approximation for TAP and 2-Edge-Connectivity. |
OPODIS |
2017 |
DBLP DOI BibTeX RDF |
|
12 | Yuefang Sun |
Sharp upper bounds for generalized edge-connectivity of product graphs. |
Discuss. Math. Graph Theory |
2016 |
DBLP DOI BibTeX RDF |
|
12 | Xueliang Li 0001, Yaping Mao |
Graphs with large generalized (edge-)connectivity. |
Discuss. Math. Graph Theory |
2016 |
DBLP DOI BibTeX RDF |
|
12 | Glencora Borradaile, Philip N. Klein |
The Two-Edge Connectivity Survivable-Network Design Problem in Planar Graphs. |
ACM Trans. Algorithms |
2016 |
DBLP DOI BibTeX RDF |
|
12 | Guy Kortsarz, Zeev Nutov |
A Simplified 1.5-Approximation Algorithm for Augmenting Edge-Connectivity of a Graph from 1 to 2. |
ACM Trans. Algorithms |
2016 |
DBLP DOI BibTeX RDF |
|
12 | Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis |
2-Edge Connectivity in Directed Graphs. |
ACM Trans. Algorithms |
2016 |
DBLP DOI BibTeX RDF |
|
12 | Carsten Thomassen |
Orientations of infinite graphs with prescribed edge-connectivity. |
Comb. |
2016 |
DBLP DOI BibTeX RDF |
|
12 | Mingzu Zhang, Lianzhu Zhang, Xing Feng |
Reliability measures in relation to the h-extra edge-connectivity of folded hypercubes. |
Theor. Comput. Sci. |
2016 |
DBLP DOI BibTeX RDF |
|
12 | Seongmin Ok, R. Bruce Richter, Carsten Thomassen |
Liftings in Finite Graphs and Linkages in Infinite Graphs with Prescribed Edge-Connectivity. |
Graphs Comb. |
2016 |
DBLP DOI BibTeX RDF |
|