|
|
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 22nd International Colloquium, ICALP95, Szeged, Hungary, July 10-14, 1995, Proceedings, pp. 280-291, 1995, Springer, 3-540-60084-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
34 | Eyal Amir, Robert Krauthgamer, Satish Rao |
Constant factor approximation of vertex-cuts in planar graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA, pp. 90-99, 2003, ACM, 1-58113-674-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005, pp. 563-572, 2005, ACM, 1-58113-960-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Data Knowl. Eng. ![In: Data Knowl. Eng. 72, pp. 285-303, 2012. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DCOSS ![In: Distributed Computing in Sensor Systems, 5th IEEE International Conference, DCOSS 2009, Marina del Rey, CA, USA, June 8-10, 2009. Proceedings, pp. 343-355, 2009, Springer, 978-3-642-02084-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FAW ![In: Frontiers in Algorithmics, First Annual International Workshop, FAW 2007, Lanzhou, China, August 1-3, 2007, Proceedings, pp. 337-345, 2007, Springer, 978-3-540-73813-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
3-connected 3-regular graph, removable edge, edge-vertex-cut fragment |
24 | Rajneesh Hegde |
Finding 3-shredders efficiently. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 2(1), pp. 14-43, 2006. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SecPerU ![In: Second International Workshop on Security, Privacy and Trust in Pervasive and Ubiquitous Computing (SecPerU 2006), 29 June 2006, Lyon, France, pp. 7-15, 2006, IEEE Computer Society, 0-7695-2549-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 20(3), pp. 413-422, 2004. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 47(8), pp. 888-893, 1998. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAAN ![In: Combinatorial and Algorithmic Aspects of Networking, First Workshop on Combinatorial and Algorithmic Aspects of Networking, CAAN 2004, Banff, Alberta, Canada, August 5-7, 2004, Revised Selected Papers, pp. 49-62, 2004, Springer, 3-540-27873-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
20 | Bo Brinkman, Adriana Karagiozova, James R. Lee |
Vertex cuts, random walks, and dimension reduction in series-parallel graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007, pp. 621-630, 2007, ACM, 978-1-59593-631-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2308.03209, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Yonggang Jiang, Sagnik Mukhopadhyay |
Finding a Small Vertex Cut on Distributed Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2302.11651, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Rekha Santhanam, Samir Shukla |
Vertex cut of a graph and connectivity of its neighbourhood complex. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 346(8), pp. 113432, August 2023. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE ![In: 39th IEEE International Conference on Data Engineering, ICDE 2023, Anaheim, CA, USA, April 3-7, 2023, pp. 1019-1031, 2023, IEEE, 979-8-3503-2227-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Yonggang Jiang, Sagnik Mukhopadhyay |
Finding a Small Vertex Cut on Distributed Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, Orlando, FL, USA, June 20-23, 2023, pp. 1791-1801, 2023, ACM, 978-1-4503-9913-5. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Itai Boneh, Robert Krauthgamer |
Optimal Vertex-Cut Sparsification of Quasi-Bipartite Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2207.01459, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
19 | Mohammed Lalou |
On the Complexity of the K-way Vertex Cut Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2112.01781, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
19 | Zhiyang He, Jason Li 0006, Magnus Wahlström |
Near-Linear-Time, Optimal Vertex Cut Sparsifiers in Directed Acyclic Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 52:1-52:14, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. Comput. ![In: Math. Program. Comput. 12(2), pp. 133-164, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
19 | Zhiyang He, Jason Li 0006 |
Tight Bound on Vertex Cut Sparsifiers in Directed Acyclic Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2011.13485, 2020. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2010.04414, 2020. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICA3PP (1) ![In: Algorithms and Architectures for Parallel Processing - 19th International Conference, ICA3PP 2019, Melbourne, VIC, Australia, December 9-11, 2019, Proceedings, Part I, pp. 17-32, 2019, Springer, 978-3-030-38990-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1803.05860, 2018. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CDC ![In: 57th IEEE Conference on Decision and Control, CDC 2018, Miami, FL, USA, December 17-19, 2018, pp. 4882-4889, 2018, IEEE, 978-1-5386-1395-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSDBM ![In: Proceedings of the 29th International Conference on Scientific and Statistical Database Management, Chicago, IL, USA, June 27-29, 2017, pp. 39:1-39:4, 2017, ACM, 978-1-4503-5282-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE ![In: 32nd IEEE International Conference on Data Engineering, ICDE 2016, Helsinki, Finland, May 16-20, 2016, pp. 97-108, 2016, IEEE Computer Society, 978-1-5090-2020-1. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
19 | Hlib Mykhailenko, Giovanni Neglia, Fabrice Huet |
Which metrics for vertex-cut partitioning? ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICITST ![In: 11th International Conference for Internet Technology and Secured Transactions, ICITST 2016, Barcelona, Spain, December 5-7, 2016, pp. 74-79, 2016, IEEE, 978-1-908320-73-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BigData Congress ![In: 2016 IEEE International Congress on Big Data, San Francisco, CA, USA, June 27 - July 2, 2016, pp. 1-8, 2016, IEEE Computer Society, 978-1-5090-2622-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
19 | Cong Xie, Wu-Jun Li, Zhihua Zhang |
S-PowerGraph: Streaming Graph Partitioning for Natural Graphs by Vertex-Cut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1511.02586, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
19 | Rujun Sun, Lufei Zhang, Zuoning Chen, Ziyu Hao |
A Balanced Vertex Cut Partition Method in Distributed Graph Computing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IScIDE (2) ![In: Intelligence Science and Big Data Engineering. Big Data and Machine Learning Techniques - 5th International Conference, IScIDE 2015, Suzhou, China, June 14-16, 2015, Revised Selected Papers, Part II, pp. 43-54, 2015, Springer, 978-3-319-23861-6. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
19 | André Berger, Alexander Grigoriev, Ruben van der Zwaan |
Complexity and approximability of the k-way vertex cut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Networks ![In: Networks 63(2), pp. 170-178, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
19 | Fatemeh Rahimian, Amir Hossein Payberah, Sarunas Girdzijauskas, Seif Haridi |
Distributed Vertex-Cut Partitioning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAIS ![In: Distributed Applications and Interoperable Systems - 14th IFIP WG 6.1 International Conference, DAIS 2014, Held as Part of the 9th International Federated Conference on Distributed Computing Techniques, DisCoTec 2014, Berlin, Germany, June 3-5, 2014, Proceedings, pp. 186-200, 2014, Springer, 978-3-662-43351-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 39, pp. 59-66, 2012. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Congress on Evolutionary Computation ![In: Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2009, Trondheim, Norway, 18-21 May, 2009, pp. 3226-3233, 2009, IEEE, 978-1-4244-2958-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
19 | Guoping Wang, Qiongxiang Huang, Jing Cai |
On the spectral radius of graphs with k-vertex cut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Comb. ![In: Ars Comb. 89, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
19 | Lorentz Jäntschi, Sorana D. Bolboaca |
Informational Entropy of B-ary Trees after a Vertex Cut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Entropy ![In: Entropy 10(4), pp. 576-588, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
10 | Wenchao Huang, Yan Xiong, Depin Chen |
DAAODV: A Secure Ad Hoc Routing Protocol Based on Direct Anonymous Attestation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSE (2) ![In: Proceedings of the 12th IEEE International Conference on Computational Science and Engineering, CSE 2009, Vancouver, BC, Canada, August 29-31, 2009, pp. 809-816, 2009, IEEE Computer Society, 978-1-4244-5334-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
10 | Xiaodong Liang, Jixiang Meng |
Connectivity of Connected Bipartite Graphs with Two Orbits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
International Conference on Computational Science (3) ![In: Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27 - 30, 2007, Proceedings, Part III, pp. 334-337, 2007, Springer, 978-3-540-72587-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 14(3), pp. 374-384, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #41 of 41 (100 per page; Change: )
|
|