|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 22 occurrences of 19 keywords
|
|
|
Results
Found 41 publication records. Showing 41 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
49 | Monika Rauch Henzinger |
Approximating Minimum Cuts under Insertions. |
ICALP |
1995 |
DBLP DOI BibTeX RDF |
|
34 | Eyal Amir, Robert Krauthgamer, Satish Rao |
Constant factor approximation of vertex-cuts in planar graphs. |
STOC |
2003 |
DBLP DOI BibTeX RDF |
balanced cut, planar separator, quotient cut, vertex separator, approximation algorithms, planar graph |
34 | Uriel Feige, Mohammad Taghi Hajiaghayi, James R. Lee |
Improved approximation algorithms for minimum-weight vertex separators. |
STOC |
2005 |
DBLP DOI BibTeX RDF |
vertex separators, approximation algorithms, semidefinite programming, treewidth, metric embeddings |
28 | Mijung Kim, K. Selçuk Candan |
SBV-Cut: Vertex-cut based graph partitioning using structural balance vertices. |
Data Knowl. Eng. |
2012 |
DBLP DOI BibTeX RDF |
|
24 | Kamrul Islam 0001, Selim G. Akl, Henk Meijer |
Distributed Generation of a Family of Connected Dominating Sets in Wireless Sensor Networks. |
DCOSS |
2009 |
DBLP DOI BibTeX RDF |
Minimum Vertex-cut, Wireless Sensor Network, Distributed Algorithm, Maximal Clique |
24 | Haiyan Kang, Jichang Wu, Guojun Li |
Removable Edges of a Spanning Tree in 3-Connected 3-Regular Graphs. |
FAW |
2007 |
DBLP DOI BibTeX RDF |
3-connected 3-regular graph, removable edge, edge-vertex-cut fragment |
24 | Rajneesh Hegde |
Finding 3-shredders efficiently. |
ACM Trans. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
four-connected, shredder, vertex cut, Depth-first search |
24 | A. Karygiannis, E. Antonakakis, A. Apostolopoulos |
Detecting Critical Nodes for MANET Intrusion Detection Systems. |
SecPerU |
2006 |
DBLP DOI BibTeX RDF |
edge-cut, vertex-cut, security, mobile ad hoc network, MANET, intrusion detection, IDS |
24 | Jichang Wu, Xueliang Li 0001 |
Removable Edges in Longest Cycles of 4-Connected Graphs. |
Graphs Comb. |
2004 |
DBLP DOI BibTeX RDF |
4-Connected graph, Removable edge, Contractible edge, Edge-vertex-cut fragment |
24 | Jie Wu 0001, Guanghui Guo |
Fault Tolerance Measures for m-Ary n-Dimensional Hypercubes Based on Forbidden Faulty Sets. |
IEEE Trans. Computers |
1998 |
DBLP DOI BibTeX RDF |
forbidden faulty sets, minimum vertex cut, Fault tolerance, hypercubes |
20 | Thomas Erlebach, Alexander Hall, Alessandro Panconesi, Danica Vukadinovic |
Cuts and Disjoint Paths in the Valley-Free Path Model of Internet BGP Routing. |
CAAN |
2004 |
DBLP DOI BibTeX RDF |
|
20 | Bo Brinkman, Adriana Karagiozova, James R. Lee |
Vertex cuts, random walks, and dimension reduction in series-parallel graphs. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
approximation algorithms, dimension reduction, metric embeddings |
19 | Kaidi Cao, Rui Deng, Shirley Wu, Edward W. Huang, Karthik Subbian, Jure Leskovec |
Communication-Free Distributed GNN Training with Vertex Cut. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Yonggang Jiang, Sagnik Mukhopadhyay |
Finding a Small Vertex Cut on Distributed Networks. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Rekha Santhanam, Samir Shukla |
Vertex cut of a graph and connectivity of its neighbourhood complex. |
Discret. Math. |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Wenwen Qu, Weixi Zhang, Ji Cheng, Chaorui Zhang, Wei Han 0004, Bo Bai 0001, Chen Jason Zhang, Liang He, Xiaoling Wang |
Optimizing Graph Partition by Optimal Vertex-Cut: A Holistic Approach. |
ICDE |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Yonggang Jiang, Sagnik Mukhopadhyay |
Finding a Small Vertex Cut on Distributed Networks. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Itai Boneh, Robert Krauthgamer |
Optimal Vertex-Cut Sparsification of Quasi-Bipartite Graphs. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
19 | Mohammed Lalou |
On the Complexity of the K-way Vertex Cut Problem. |
CoRR |
2021 |
DBLP BibTeX RDF |
|
19 | Zhiyang He, Jason Li 0006, Magnus Wahlström |
Near-Linear-Time, Optimal Vertex Cut Sparsifiers in Directed Acyclic Graphs. |
ESA |
2021 |
DBLP DOI BibTeX RDF |
|
19 | Fabio Furini, Ivana Ljubic, Enrico Malaguti, Paolo Paronuzzi |
On integer and bilevel formulations for the k-vertex cut problem. |
Math. Program. Comput. |
2020 |
DBLP DOI BibTeX RDF |
|
19 | Zhiyang He, Jason Li 0006 |
Tight Bound on Vertex Cut Sparsifiers in Directed Acyclic Graphs. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
19 | Guixiang Ma, Yao Xiao, Theodore L. Willke, Nesreen K. Ahmed, Shahin Nazarian, Paul Bogdan |
A Vertex Cut based Framework for Load Balancing and Parallelism Optimization in Multi-core Systems. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
19 | Jie Wang, Dagang Li |
SWR: Using Windowed Reordering to Achieve Fast and Balanced Heuristic for Streaming Vertex-Cut Graph Partitioning. |
ICA3PP (1) |
2019 |
DBLP DOI BibTeX RDF |
|
19 | Shuai Wang 0029, John Baillieul |
Power Grid Decomposition Based on Vertex Cut Sets and Its Applications to Topology Control and Power Trading. |
CoRR |
2018 |
DBLP BibTeX RDF |
|
19 | Shuai Wang 0029, John Baillieul |
Power Grid Decomposition Based on Vertex Cut Sets and Its Applications to Topology Control and Power Trading. |
CDC |
2018 |
DBLP DOI BibTeX RDF |
|
19 | Yifan Li 0002, Camélia Constantin, Cédric du Mouza |
SGVCut: A Vertex-Cut Partitioning Tool for Random Walks-based Computations over Social Network graphs. |
SSDBM |
2017 |
DBLP DOI BibTeX RDF |
|
19 | Yun Peng, Byron Choi, Bingsheng He, Shuigeng Zhou, Ruzhi Xu, Xiaohui Yu 0001 |
VColor: A practical vertex-cut based approach for coloring large graphs. |
ICDE |
2016 |
DBLP DOI BibTeX RDF |
|
19 | Hlib Mykhailenko, Giovanni Neglia, Fabrice Huet |
Which metrics for vertex-cut partitioning? |
ICITST |
2016 |
DBLP DOI BibTeX RDF |
|
19 | Hooman Peiro Sajjad, Amir Hossein Payberah, Fatemeh Rahimian, Vladimir Vlassov, Seif Haridi |
Boosting Vertex-Cut Partitioning for Streaming Graphs. |
BigData Congress |
2016 |
DBLP DOI BibTeX RDF |
|
19 | Cong Xie, Wu-Jun Li, Zhihua Zhang |
S-PowerGraph: Streaming Graph Partitioning for Natural Graphs by Vertex-Cut. |
CoRR |
2015 |
DBLP BibTeX RDF |
|
19 | Rujun Sun, Lufei Zhang, Zuoning Chen, Ziyu Hao |
A Balanced Vertex Cut Partition Method in Distributed Graph Computing. |
IScIDE (2) |
2015 |
DBLP DOI BibTeX RDF |
|
19 | André Berger, Alexander Grigoriev, Ruben van der Zwaan |
Complexity and approximability of the k-way vertex cut. |
Networks |
2014 |
DBLP DOI BibTeX RDF |
|
19 | Fatemeh Rahimian, Amir Hossein Payberah, Sarunas Girdzijauskas, Seif Haridi |
Distributed Vertex-Cut Partitioning. |
DAIS |
2014 |
DBLP DOI BibTeX RDF |
|
19 | Jesús Sánchez-Oro, Abraham Duarte |
An experimental comparison of Variable Neighborhood Search variants for the minimization of the vertex-cut in layout problems. |
Electron. Notes Discret. Math. |
2012 |
DBLP DOI BibTeX RDF |
|
19 | Maolin Tang, Colin J. Fidge |
A genetic algorithm for the multi-source and multi-sink minimum vertex cut problem and its applications. |
IEEE Congress on Evolutionary Computation |
2009 |
DBLP DOI BibTeX RDF |
|
19 | Guoping Wang, Qiongxiang Huang, Jing Cai |
On the spectral radius of graphs with k-vertex cut. |
Ars Comb. |
2008 |
DBLP BibTeX RDF |
|
19 | Lorentz Jäntschi, Sorana D. Bolboaca |
Informational Entropy of B-ary Trees after a Vertex Cut. |
Entropy |
2008 |
DBLP DOI BibTeX RDF |
|
10 | Wenchao Huang, Yan Xiong, Depin Chen |
DAAODV: A Secure Ad Hoc Routing Protocol Based on Direct Anonymous Attestation. |
CSE (2) |
2009 |
DBLP DOI BibTeX RDF |
|
10 | Xiaodong Liang, Jixiang Meng |
Connectivity of Connected Bipartite Graphs with Two Orbits. |
International Conference on Computational Science (3) |
2007 |
DBLP DOI BibTeX RDF |
Connectivity, Bipartite graph, Orbit |
10 | Wen-Ben Jone, Christos A. Papachristou |
A coordinated circuit partitioning and test generation method for pseudo-exhaustive testing of VLSI circuits. |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. |
1995 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #41 of 41 (100 per page; Change: )
|
|