Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
91 | Weifa Liang, Richard P. Brent, Hong Shen |
Fully Dynamic Maintenance of k-Connectivity in Parallel. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 12(8), pp. 846-864, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
2-edge/vertex connectivity, 3-edge/vertex connectivity, parallel algorithm design and analysis, dynamic data structures, graph problems, NC algorithms |
72 | David Eppstein, Zvi Galil, Giuseppe F. Italiano, Amnon Nissenzweig |
Sparsification - a technique for speeding up dynamic graph algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 44(5), pp. 669-696, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
edge and vertex connectivity, minimum spanning trees, dynamic graph algorithms |
71 | Tanmoy Chakraborty 0001, Julia Chuzhoy, Sanjeev Khanna |
Network design for vertex connectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 167-176, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
approximation algorithms, network design, hardness of approximation, vertex connectivity |
67 | Yuichi Yoshida, Hiro Ito |
Property Testing on k-Vertex-Connectivity of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games, pp. 539-550, 2008, Springer, 978-3-540-70574-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
59 | Amos Korman |
Labeling Schemes for Vertex Connectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings, pp. 102-109, 2007, Springer, 978-3-540-73419-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Graph algorithms, labeling schemes, vertex-connectivity |
57 | Harold N. Gabow |
Using expander graphs to find vertex connectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 53(5), pp. 800-844, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
graphs, Expander graphs, vertex connectivity |
57 | Julia Chuzhoy, Sanjeev Khanna |
Algorithms for Single-Source Vertex Connectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, October 25-28, 2008, Philadelphia, PA, USA, pp. 105-114, 2008, IEEE Computer Society, 978-0-7695-3436-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
53 | R. Ravi 0001, David P. Williamson |
Erratum: An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 34(1), pp. 98-107, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
50 | Toshimasa Ishii |
Greedy Approximation for Source Location Problem with Vertex-Connectivity Requirements in Undirected Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007, Proceedings, pp. 29-40, 2007, Springer, 978-3-540-77118-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
48 | Guy Kortsarz, Robert Krauthgamer, James R. Lee |
Hardness of Approximation for Vertex-Connectivity Network-Design Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX ![In: Approximation Algorithms for Combinatorial Optimization, 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002, Proceedings, pp. 185-199, 2002, Springer, 3-540-44186-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
47 | Chandra Chekuri, Nitish Korula |
A Graph Reduction Step Preserving Element-Connectivity and Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I, pp. 254-265, 2009, Springer, 978-3-642-02926-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
43 | Bill Jackson, Tibor Jordán |
Independence Free Graphs and Vertex Connectivity Augmentation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings, pp. 264-279, 2001, Springer, 3-540-42225-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
43 | Lisa Fleischer |
A 2-Approximation for Minimum Cost {0, 1, 2} Vertex Connectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings, pp. 115-129, 2001, Springer, 3-540-42225-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
41 | Michal Katz, Nir A. Katz, Amos Korman, David Peleg |
Labeling schemes for flow and connectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 6-8, 2002, San Francisco, CA, USA., pp. 927-936, 2002, ACM/SIAM, 0-89871-513-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP BibTeX RDF |
|
40 | Ning Li 0014, Jennifer C. Hou |
FLSS: a fault-tolerant topology control algorithm for wireless networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MobiCom ![In: Proceedings of the 10th Annual International Conference on Mobile Computing and Networking, MOBICOM 2004, 2004, Philadelphia, PA, USA, September 26 - October 1, 2004, pp. 275-286, 2004, ACM, 1-58113-868-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
k-vertex, fault tolerance, wireless networks, connectivity, topology control, energy management |
40 | Julia Chuzhoy, Sanjeev Khanna |
An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, October 25-27, 2009, Atlanta, Georgia, USA, pp. 437-441, 2009, IEEE Computer Society, 978-0-7695-3850-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
vertex-connectivity, survivable network design |
40 | László A. Végh, András A. Benczúr |
Primal-dual approach for directed vertex connectivity augmentation and generalizations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 4(2), pp. 20:1-20:21, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Vertex connectivity augmentation, combinatorial algorithm |
40 | Harold N. Gabow |
Using Expander Graphs to Find Vertex Connectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, 12-14 November 2000, Redondo Beach, California, USA, pp. 410-420, 2000, IEEE Computer Society, 0-7695-0850-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
nesting properties, separation triples, computational complexity, complexity, graph theory, expander graphs, undirected graph, digraph, time bound, vertex connectivity |
40 | Monika Rauch Henzinger, Satish Rao, Harold N. Gabow |
Computing Vertex Connectivity: New Bounds from Old Techniques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 37th Annual Symposium on Foundations of Computer Science, FOCS '96, Burlington, Vermont, USA, 14-16 October, 1996, pp. 462-471, 1996, IEEE Computer Society, 0-8186-7594-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
smallest number of vertices, preflow push algorithm, computational geometry, deterministic algorithm, digraph, error probability, vertex connectivity |
39 | Joseph Cheriyan, John H. Reif |
Directed s-t Bumberings, Rubber Bands, and Testing Digraph k-Vertex Connectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 27-29 January 1992, Orlando, Florida, USA., pp. 335-344, 1992, ACM/SIAM, 0-89791-466-X. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP BibTeX RDF |
|
37 | L. Sunil Chandran |
Edge Connectivity vs Vertex Connectivity in Chordal Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 7th Annual International Conference, COCOON 2001, Guilin, China, August 20-23, 2001, Proceedings, pp. 384-389, 2001, Springer, 3-540-42494-6. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
35 | Mariko Sakashita, Kazuhisa Makino, Satoru Fujishige |
Minimum Cost Source Location Problems with Flow Requirements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 50(4), pp. 555-583, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Approximation algorithm, Combinatorial optimization, Connectivity, Location problem |
35 | Yuk Hei Chan, Wai Shing Fung, Lap Chi Lau, Chun Kong Yung |
Degree Bounded Network Design with Metric Costs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, October 25-28, 2008, Philadelphia, PA, USA, pp. 125-134, 2008, IEEE Computer Society, 978-0-7695-3436-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
33 | Monika Rauch Henzinger |
A Static 2-Approximation Algorithm for Vertex Connectivity and Incremental Approximation Algorithms for Edge and Vertex Connectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Algorithms ![In: J. Algorithms 24(1), pp. 194-220, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
33 | Tsan-sheng Hsu |
Undirected Vertex-Connectivity Structure and Smallest Four-Vertex-Connectivity Augmentation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 6th International Symposium, ISAAC '95, Cairns, Australia, December 4-6, 1995, Proceedings, pp. 274-283, 1995, Springer, 3-540-60573-8. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
33 | Marcelo M. de Azevedo, Nader Bagherzadeh, Shahram Latifi |
Fault-diameter of the star-connected cycles interconnection network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HICSS (2) ![In: 28th Annual Hawaii International Conference on System Sciences (HICSS-28), January 3-6, 1995, Kihei, Maui, Hawaii, USA, pp. 469-478, 1995, IEEE Computer Society, 0-8186-6945-4. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
star-connected cycles interconnection network, maximum diameter, fault-free, fixed constant, fault tolerance, reliability, graph theory, parallel architectures, fault tolerant computing, graph, multiprocessor interconnection networks, vertex connectivity, fault-diameter |
31 | Joseph Cheriyan, Santosh S. Vempala, Adrian Vetta |
Network Design Via Iterative Rounding Of Setpair Relaxations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 26(3), pp. 255-275, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 68W25, 90C27, 68R10, 90C35, 05C40, 90B10 |
31 | Ning Li 0014, Jennifer C. Hou |
Localized Fault-Tolerant Topology Control in Wireless Ad Hoc Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 17(4), pp. 307-320, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
fault tolerance, wireless ad hoc networks, topology control, localized algorithms, Algorithm design and analysis |
31 | L. Sunil Chandran, N. S. Narayanaswamy |
On the Arrangement of Cliques in Chordal Graphs with Respect to the Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 10th Annual International Conference, COCOON 2004, Jeju Island, Korea, August 17-20, 2004, Proceedings, pp. 151-160, 2004, Springer, 3-540-22856-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
30 | Pei-Chi Huang, Hsin-Wen Wei, Yen-Chiu Chen, Ming-Yang Kao, Wei-Kuan Shih, Tsan-sheng Hsu |
Two-Vertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings, pp. 1195-1204, 2009, Springer, 978-3-642-10630-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
30 | Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki |
K-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 9th International Symposium, ISAAC '98, Taejon, Korea, December 14-16, 1998, Proceedings, pp. 159-168, 1998, Springer, 3-540-65385-6. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
27 | Weifa Liang, George Havas |
NC Approximation Algorithms for 2-Connectivity Augmentation in a Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Euro-Par ![In: Euro-Par '97 Parallel Processing, Third International Euro-Par Conference, Passau, Germany, August 26-29, 1997, Proceedings, pp. 430-439, 1997, Springer, 3-540-63440-1. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
26 | Jianhui Zhang, Jiming Chen 0001, Yu Wang 0003, Yang Xiao 0001, Youxian Sun |
A simple algorithm for fault-tolerant topology control in wireless sensor network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PIMRC ![In: Proceedings of the IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC 2008, 15-18 September 2008, Cannes, French Riviera, France, pp. 1-5, 2008, IEEE. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
26 | Samir Khuller, Uzi Vishkin |
Biconnectivity Approximations and Graph Carvings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 41(2), pp. 214-235, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
sparse subgraphs, connectivity, biconnectivity |
26 | Mariko Sakashita, Kazuhisa Makino, Satoru Fujishige |
Minimum Cost Source Location Problems with Flow Requirements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006, Proceedings, pp. 769-780, 2006, Springer, 3-540-32755-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
26 | Keren Censor-Hillel, Mohsen Ghaffari 0001, George Giakkoupis, Bernhard Haeupler, Fabian Kuhn |
Tight Bounds on Vertex Connectivity Under Vertex Sampling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015, pp. 2006-2018, 2015, SIAM, 978-1-61197-374-7. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
26 | Loukas Georgiadis |
Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I, pp. 738-749, 2010, Springer, 978-3-642-14164-5. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
25 | Matthias Kriesell |
A Survey on Contractible Edges in Graphs of a Prescribed Vertex Connectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 18(1), pp. 1-30, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
25 | R. Ravi 0001, David P. Williamson |
Erratum: an approximation algorithm for minimum-cost vertex-connectivity problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 6-8, 2002, San Francisco, CA, USA., pp. 1000-1001, 2002, ACM/SIAM, 0-89871-513-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP BibTeX RDF |
|
24 | Christos A. Athanasiadis |
On the Graph Connectivity of Skeleta of Convex Polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 42(2), pp. 155-165, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Balinski’s theorem, Incidence graph, Skeleton, Convex polytope, Cell complex, Vertex connectivity |
24 | Weiping Shang, F. Frances Yao, Peng-Jun Wan, Xiaodong Hu 0001 |
Algorithms for Minimum m -Connected k -Dominating Set Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA ![In: Combinatorial Optimization and Applications, First International Conference, COCOA 2007, Xi'an, China, August 14-16, 2007, Proceedings, pp. 182-190, 2007, Springer, 978-3-540-73555-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
k-vertex connectivity, wireless sensor networks, approximation algorithm, Connected dominating set |
24 | Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki |
Augmenting a (k-1)-Vertex-Connected Multigraph l-Edge-Connected and k-Vertex-Connected Multigraph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 44(3), pp. 257-280, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Undirected multigraph, Graph augmentation, Deterministic algorithm, Edge-connectivity, Vertex-connectivity, Polynomial time approximation algorithm |
24 | Shahram Latifi, Manju V. Hegde, Morteza Naraghi-Pour |
Conditional Connectivity Measures for Large Multiprocessor Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 43(2), pp. 218-222, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
conditional connectivity, large regular graphs, n-dimensional cube, fault tolerant computing, hypercube, multiprocessing systems, multiprocessor systems, hypercube networks, vertex connectivity |
24 | Kemal Efe |
A Variation on the Hypercube with Lower Diameter. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 40(11), pp. 1312-1316, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
distributed-memory parallel computer architectures, large vertex connectivity, link complexity, routing, parallel architectures, hypercube, regularity, hypercube networks, broadcasting algorithms, interconnection structure |
24 | Samir Khuller, Baruch Schieber |
Efficient Parallel Algorithms for Testing Connectivity and Finding Disjoint s-t Paths in Graphs (Extended Summary) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pp. 288-293, 1989, IEEE Computer Society, 0-8186-1982-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
k-edge disjoint paths, testing connectivity, disjoint s-t paths, optimal speedup algorithm, k-vertex connectivity, parallel algorithms, graphs, CRCW PRAM |
23 | Clarianne Luciola de A. V. M. Lucas, Renata R. Del-Vecchio, Maria Aguieiras A. de Freitas, Joice S. do Nascimento |
Relationships between algebraic connectivity and vertex connectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Appl. Math. ![In: Comput. Appl. Math. 41(3), April 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Jun Liang 0002, Meixin Du, Ruihua Nie, Zhihao Liang, Zheng Li |
Distributed Algorithms for Cyclic Edge Connectivity and Cyclic Vertex Connectivity of Cubic Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDSP ![In: ICDSP 2020: 4th International Conference on Digital Signal Processing, Chengdu, China, June 19-21, 2020, pp. 279-283, 2020, ACM, 978-1-4503-7687-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
23 | Abusayeed Saifullah |
2-Edge-Connectivity and 2-Vertex-Connectivity of an Asynchronous Distributed Network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1906.10275, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
23 | Hiro Ito, Motoyasu Ito, Yuichiro Itatsu, Kazuhiro Nakai, Hideyuki Uehara, Mitsuo Yokoyama |
Source location problems considering vertex-connectivity and edge-connectivity simultaneously. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Networks ![In: Networks 40(2), pp. 63-70, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
23 | Zvi Galil, Giuseppe F. Italiano |
Reducing edge connectivity to vertex connectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGACT News ![In: SIGACT News 22(1), pp. 57-61, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
22 | Faisal N. Abu-Khzam, Michael A. Langston |
Graph Coloring and the Immersion Order. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 9th Annual International Conference, COCOON 2003, Big Sky, MT, USA, July 25-28, 2003, Proceedings, pp. 394-403, 2003, Springer, 3-540-40534-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
19 | Davide Bilò, Thomas Erlebach, Matús Mihalák, Peter Widmayer |
Discovery of Network Properties with All-Shortest-Paths Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIROCCO ![In: Structural Information and Communication Complexity, 15th International Colloquium, SIROCCO 2008, Villars-sur-Ollon, Switzerland, June 17-20, 2008, Proceedings, pp. 89-103, 2008, Springer, 978-3-540-69326-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Dong-Gyu Park, Yang-Soo Kim, Hwan-Gue Cho |
Triangle Mesh Compression for Fast Rendering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IV ![In: International Conference on Information Visualisation, IV 1999, London, England, UK, July 14-16, 1999, pp. 280-285, 1999, IEEE Computer Society, 0-7695-0210-5. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Geometry Modeling, Mesh Compression, Realtime Rendering |
18 | Brahim Hamid, Bertrand Le Saëc, Mohamed Mosbah 0001 |
Distributed Local 2-Connectivity Test of Graphs and Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPA ![In: Parallel and Distributed Processing and Applications, 5th International Symposium, ISPA 2007, Niagara Falls, Canada, August 29-31, 2007, Proceedings, pp. 195-207, 2007, Springer, 978-3-540-74741-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Yong Chen, S. H. Son |
A fault tolerant topology control in wireless sensor networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AICCSA ![In: 2005 ACS / IEEE International Conference on Computer Systems and Applications (AICCSA 2005), January 3-6, 2005, Cairo, Egypt, pp. 57, 2005, IEEE Computer Society, 0-7803-8735-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
18 | Monika Rauch Henzinger, Michael L. Fredman |
Lower Bounds for Fully Dynamic Connectivity Problems in Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 22(3), pp. 351-362, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Dynamic planarity testing, Dynamic connectivity testing, Dynamic planarity testing, Dynamic connectivity testing, Lower bounds, Lower bounds, Key words, Cell probe model, Cell probe model |
17 | Yong Ding 0002, Chen Wang 0010, Li Xiao 0001 |
An Adaptive Partitioning Scheme for Sleep Scheduling and Topology Control in Wireless Sensor Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 20(9), pp. 1352-1365, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
17 | Yong Ding 0002, Chen Wang 0010, Li Xiao 0001 |
A Connectivity Based Partition Approach for Node Scheduling in Sensor Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DCOSS ![In: Distributed Computing in Sensor Systems, Third IEEE International Conference, DCOSS 2007, Santa Fe, NM, USA, June 18-20, 2007, Proceedings, pp. 354-367, 2007, Springer, 978-3-540-73089-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
17 | Frank Kammer, Hanjo Täubig |
Connectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Network Analysis ![In: Network Analysis: Methodological Foundations [outcome of a Dagstuhl seminar, 13-16 April 2004], pp. 143-177, 2004, Springer, 3-540-24979-6. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
16 | Nicola Galesi, Fariba Ranjbar, Michele Zito 0001 |
Vertex-connectivity for node failure identification in Boolean Network Tomography. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 184, pp. 106450, February 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
16 | Chaitanya Nalam, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai |
Deterministic k-Vertex Connectivity in k2 Max-flows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2308.04695, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Miguel Bosch-Calvo, Fabrizio Grandoni 0001, Afrouz Jabal Ameli |
A 4/3 Approximation for 2-Vertex-Connectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2305.02240, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Wenqian Zhang, Jianfeng Wang |
Sharp spectral bounds for the vertex-connectivity of regular graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 45(2), pp. 65, March 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Jørgen Bang-Jensen, Kristine Vitting Klinkby, Pranabendu Misra, Saket Saurabh 0001 |
A Parameterized Algorithm for Vertex Connectivity Survivable Network Design Problem with Uniform Demands. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 31st Annual European Symposium on Algorithms, ESA 2023, September 4-6, 2023, Amsterdam, The Netherlands, pp. 13:1-13:15, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-295-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Miguel Bosch-Calvo, Fabrizio Grandoni 0001, Afrouz Jabal Ameli |
A 4/3 Approximation for 2-Vertex-Connectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, July 10-14, 2023, Paderborn, Germany, pp. 29:1-29:13, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-278-5. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Therese Biedl, Karthik Murali |
On Computing the Vertex Connectivity of 1-Plane Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, July 10-14, 2023, Paderborn, Germany, pp. 23:1-23:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-278-5. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Sepehr Assadi, Vihan Shah |
Tight Bounds for Vertex Connectivity in Dynamic Streams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 2023 Symposium on Simplicity in Algorithms, SOSA 2023, Florence, Italy, January 23-25, 2023, pp. 213-227, 2023, SIAM, 978-1-61197-758-5. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Zhiyi Huang, Yaowei Long, Thatchaphol Saranurak, Benyu Wang |
Tight Conditional Lower Bounds for Vertex Connectivity Problems. ![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. 1384-1395, 2023, ACM, 978-1-4503-9913-5. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Sorrachai Yingchareonthawornchai |
Vertex Connectivity via Local Computation: Breaking Quadratic Time, Poly-logarithmic Max-flows, and Derandomization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2023 |
RDF |
|
16 | Max Franck, Sorrachai Yingchareonthawornchai |
Engineering Nearly Linear-time Algorithms for Small Vertex Connectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM J. Exp. Algorithmics ![In: ACM J. Exp. Algorithmics 27, pp. 4.4:1-4.4:29, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
16 | Sepehr Assadi, Vihan Shah |
Tight Bounds for Vertex Connectivity in Dynamic Streams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2211.04685, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
16 | Jacob Holm, Ivor van der Hoog, Eva Rotenberg |
Worst-case Deterministic Fully-Dynamic Planar 2-vertex Connectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2209.14079, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
16 | Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai |
Deterministic Small Vertex Connectivity in Almost Linear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2210.13739, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
16 | Zhiyi Huang, Yaowei Long, Thatchaphol Saranurak, Benyu Wang |
Tight Conditional Lower Bounds for Vertex Connectivity Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2212.00359, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
16 | Seth Pettie, Thatchaphol Saranurak, Longhui Yin |
Optimal Vertex Connectivity Oracles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2201.00408, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
16 | Therese Biedl, Karthik Murali |
On computing the vertex connectivity of 1-plane graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2212.06782, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
16 | Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai |
Deterministic Small Vertex Connectivity in Almost Linear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 63rd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2022, Denver, CO, USA, October 31 - November 3, 2022, pp. 789-800, 2022, IEEE, 978-1-6654-5519-0. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
16 | Seth Pettie, Thatchaphol Saranurak, Longhui Yin |
Optimal vertex connectivity oracles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20 - 24, 2022, pp. 151-161, 2022, ACM, 978-1-4503-9264-8. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
16 | David L. Rhodes, Breanna N. Johnson |
A New Vertex Connectivity Metric. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2105.07968, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
16 | Jason Li 0006, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai |
Vertex Connectivity in Poly-logarithmic Max-flows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2104.00104, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
16 | Therese Biedl, Karthik Murali |
Computing the vertex connectivity of a locally maximal 1-plane graph in linear time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2112.06306, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
16 | Waldo Gálvez, Francisco Sanhueza-Matamala, José A. Soto |
Approximation Algorithms for Vertex-Connectivity Augmentation on the Cycle. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2111.02234, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
16 | Max Franck, Sorrachai Yingchareonthawornchai |
Engineering Nearly Linear-Time Algorithms for Small Vertex Connectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2103.15703, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
16 | Florian Hoersch, Zoltán Szigeti |
Eulerian orientations and vertex-connectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 289, pp. 115-124, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
16 | Jun Liang 0002, Dingjun Lou, Zan-Bo Zhang |
The cubic graphs with finite cyclic vertex connectivity larger than girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 344(2), pp. 112197, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
16 | Max Franck, Sorrachai Yingchareonthawornchai |
Engineering Nearly Linear-Time Algorithms for Small Vertex Connectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SEA ![In: 19th International Symposium on Experimental Algorithms, SEA 2021, June 7-9, 2021, Nice, France., pp. 1:1-1:18, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-185-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
16 | Waldo Gálvez, Francisco Sanhueza-Matamala, José A. Soto |
Approximation Algorithms for Vertex-Connectivity Augmentation on the Cycle. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAOA ![In: Approximation and Online Algorithms - 19th International Workshop, WAOA 2021, Lisbon, Portugal, September 6-10, 2021, Revised Selected Papers, pp. 1-22, 2021, Springer, 978-3-030-92701-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
16 | Jason Li 0006, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai |
Vertex connectivity in poly-logarithmic max-flows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021., pp. 317-329, 2021, ACM, 978-1-4503-8053-9. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
16 | Hao Li 0061, Xin Gao |
On the Vertex-Connectivity of an Uncertain Random Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Access ![In: IEEE Access 8, pp. 85504-85514, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
16 | Mehdi Djellabi, Bertrand Jouve, Frédéric Amblard |
Dense and sparse vertex connectivity in networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Complex Networks ![In: J. Complex Networks 8(3), 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
16 | Dejin Qin, Yingzhi Tian, Laihuan Chen, Jixiang Meng |
Cyclic vertex-connectivity of Cartesian product graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Parallel Emergent Distributed Syst. ![In: Int. J. Parallel Emergent Distributed Syst. 35(1), pp. 81-90, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
16 | Lukas Gianinazzi, Torsten Hoefler |
Parallel Planar Subgraph Isomorphism and Vertex Connectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2007.01199, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
16 | Mehdi Djellabi, Bertrand Jouve, Frédéric Amblard |
Dense and sparse vertex connectivity in networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2006.05679, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
16 | Suil O |
The second largest eigenvalue and vertex-connectivity of regular multigraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 279, pp. 118-124, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
16 | Zuwen Luo, Liqiong Xu |
A Kind Of Conditional Vertex Connectivity Of Cayley Graphs Generated By Wheel Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. J. ![In: Comput. J. 63(9), pp. 1372-1384, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
16 | Hiroaki Kata, Seiya Ueno |
Decentralized Robust k-connected Network with Unmanned Vehicles Using Vertex Connectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SICE ![In: 59th Annual Conference of the Society of Instrument and Control Engineers of Japan, SICE 2020, Chiang Mai, Thailand, September 23-26, 2020, pp. 1902-1907, 2020, IEEE, 978-1-7281-1089-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
16 | Lukas Gianinazzi, Torsten Hoefler |
Parallel Planar Subgraph Isomorphism and Vertex Connectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020, pp. 269-280, 2020, ACM, 978-1-4503-6935-0. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
16 | Ruifang Liu, Hong-Jian Lai, Yingzhi Tian, Yang Wu 0007 |
Vertex-connectivity and eigenvalues of graphs with fixed girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Math. Comput. ![In: Appl. Math. Comput. 344-345, pp. 141-149, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
16 | Sergey Goryainov, Dmitry Panasenko |
On vertex connectivity of Deza graphs with parameters of the complements to Seidel graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 80, pp. 143-150, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
16 | Danupon Nanongkai, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai |
Breaking Quadratic Time for Small Vertex Connectivity and an Approximation Scheme. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1904.04453, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|