Search results for "biconnectivity"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
99	Gruia Calinescu, Peng-Jun Wan	Range Assignment for Biconnectivity and k-Edge Connectivity in Wireless Ad Hoc Networks.	Mob. Networks Appl.	2006	DBLP DOI BibTeX RDF	approximation algorithms, distributed algorithm, NP-hardness, topology control, power assignment
87	Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup	Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity.	J. ACM	2001	DBLP DOI BibTeX RDF	2-edge connectivity, connectivity, minimum spanning tree, dynamic graph algorithms, Biconnectivity
80	Monika Rauch Henzinger, Johannes A. La Poutré	Certificates and Fast Algorithms for Biconnectivity in Fully-Dynamic Graphs.	ESA	1995	DBLP DOI BibTeX RDF
75	Gruia Calinescu, Peng-Jun Wan	Range Assignment for High Connectivity in Wireless Ad Hoc Networks.	ADHOC-NOW	2003	DBLP DOI BibTeX RDF
69	Art Kazmierczak, Sridhar Radhakrishnan	An Optimal Distributed Ear Decomposition Algorithm with Applications to Biconnectivity and Outerplanarity Testing.	IEEE Trans. Parallel Distributed Syst.	2000	DBLP DOI BibTeX RDF	biconnectivity testing, outerplanarity testing, Distributed algorithm, message complexity, depth first search, ear decomposition
62	Carsten Gutwenger, Petra Mutzel, Bernd Zey	Planar Biconnectivity Augmentation with Fixed Embedding.	IWOCA	2009	DBLP DOI BibTeX RDF
62	Ye Tian, Min Sheng, Jiandong Li 0001, Yan Zhang 0006, Junliang Yao	Critical Transmitting Range for Biconnectivity of One-Dimensional Wireless Ad Hoc Networks.	VTC Spring	2008	DBLP DOI BibTeX RDF
62	Ivana Ljubic, Günther R. Raidl, Jozef Kratica	A Hybrid GA for the Edge-Biconnectivity Augmentation Problem.	PPSN	2000	DBLP DOI BibTeX RDF
56	Jiong Guo, Johannes Uhlmann	Kernelization and Complexity Results for Connectivity Augmentation Problems.	WADS	2007	DBLP DOI BibTeX RDF
56	Petra Mutzel	A Polyhedral Approach to Planar Augmentation and Related Problems.	ESA	1995	DBLP DOI BibTeX RDF
50	Peng-Jun Wan, Chih-Wei Yi	Max-Life Power Schedule for Connectivity and Biconnectivity in Wireless Ad Hoc Networks.	Mob. Networks Appl.	2005	DBLP DOI BibTeX RDF	power schedule, connectivity, wireless ad hoc networks, power assignment, biconnectivity
50	Victor Chepoi, Yann Vaxès	Augmenting Trees to Meet Biconnectivity and Diameter Constraints.	Algorithmica	2002	DBLP DOI BibTeX RDF	Biconnectivity augmentation, Approximation algorithms, Trees, Diameter, Radius
50	Monika Rauch Henzinger, Valerie King	Fully Dynamic Biconnectivity and Transitive Closure.	FOCS	1995	DBLP DOI BibTeX RDF	fully dynamic biconnectivity, n-node graph, edge insertion, polylogarithmic time, Las-Vegas style, computational complexity, graph theory, randomized algorithm, transitive closure, deletion, randomised algorithms, dynamic algorithm, algorithm theory
50	Samir Khuller, Uzi Vishkin	Biconnectivity Approximations and Graph Carvings.	J. ACM	1994	DBLP DOI BibTeX RDF	sparse subgraphs, connectivity, biconnectivity
50	Monika Rauch	Fully Dynamic Biconnectivity in Graphs	FOCS	1992	DBLP DOI BibTeX RDF	query time, dynamic biconnectivity, edge insertions, linear storage, amortized running time, planar embedded graph, graphs, time complexity, deletions
49	Chen Wang, Myung Ah Park, James Willson, Yongxi Cheng, Andras Farago, Weili Wu 0001	On approximate optimal dual power assignment for biconnectivity and edge-biconnectivity.	Theor. Comput. Sci.	2008	DBLP DOI BibTeX RDF
44	Keqin Li	Topological Characteristics of Random Multihop Wireless Networks.	Clust. Comput.	2005	DBLP DOI BibTeX RDF	connectivity, bandwidth, diameter, multihop wireless network, communication latency, random network, biconnectivity
43	Carsten Gutwenger, Petra Mutzel, Bernd Zey	On the Hardness and Approximability of Planar Biconnectivity Augmentation.	COCOON	2009	DBLP DOI BibTeX RDF
37	Prithwish Basu, Jason Redi	Movement control algorithms for realization of fault-tolerant ad hoc robot networks.	IEEE Netw.	2004	DBLP DOI BibTeX RDF
37	Artur Czumaj, Andrzej Lingas	Fast Approximation Schemes for Euclidean Multi-connectivity Problems.	ICALP	2000	DBLP DOI BibTeX RDF
37	Zvi Galil, Giuseppe F. Italiano, Neil Sarnak	Fully Dynamic Planarity Testing with Applications.	J. ACM	1999	DBLP DOI BibTeX RDF	planarity testing, planar graphs, dynamic graph algorithms
26	Bin Hu 0004, Günther R. Raidl	A Memetic Algorithm for the Generalized Minimum Vertex-Biconnected Network Problem.	HIS (3)	2009	DBLP DOI BibTeX RDF	Network Design, Memetic Algorithm, Biconnectivity
24	Xiaojun Dong 0001, Letong Wang, Yan Gu 0001, Yihan Sun 0001	Provably Fast and Space-Efficient Parallel Biconnectivity.	CoRR	2023	DBLP DOI BibTeX RDF
24	Bohang Zhang, Shengjie Luo, Liwei Wang 0001, Di He 0001	Rethinking the Expressive Power of GNNs via Graph Biconnectivity.	CoRR	2023	DBLP DOI BibTeX RDF
24	Xiaojun Dong 0001, Letong Wang, Yan Gu 0001, Yihan Sun 0001	Provably Fast and Space-Efficient Parallel Biconnectivity (Abstract).	HOPC@SPAA	2023	DBLP DOI BibTeX RDF
24	Jacob Holm, Ivor van der Hoog, Eva Rotenberg	Worst-Case Deterministic Fully-Dynamic Biconnectivity in Changeable Planar Embeddings.	SoCG	2023	DBLP DOI BibTeX RDF
24	Xiaojun Dong 0001, Letong Wang, Yan Gu 0001, Yihan Sun 0001	Provably Fast and Space-Efficient Parallel Biconnectivity.	PPoPP	2023	DBLP DOI BibTeX RDF
24	Bohang Zhang, Shengjie Luo, Liwei Wang 0001, Di He 0001	Rethinking the Expressive Power of GNNs via Graph Biconnectivity.	ICLR	2023	DBLP BibTeX RDF
24	Ian Bogle, George M. Slota	Distributed Algorithms for the Graph Biconnectivity and Least Common Ancestor Problems.	IPDPS Workshops	2022	DBLP DOI BibTeX RDF
24	Ian Bogle, George M. Slota	Achieving Speedups for Distributed Graph Biconnectivity.	HPEC	2022	DBLP DOI BibTeX RDF
24	Jacob Holm, Eva Rotenberg	Good r-Divisions Imply Optimal Amortized Decremental Biconnectivity.	STACS	2021	DBLP DOI BibTeX RDF
24	Guangyao Shi, Ishat E. Rabban, Pratap Tokekar	Fast Biconnectivity Restoration in Multi-Robot Systems for Robust Communication Maintenance.	CoRR	2020	DBLP BibTeX RDF
24	Jacob Holm, Eva Rotenberg	Good r-divisions Imply Optimal Amortised Decremental Biconnectivity.	CoRR	2018	DBLP BibTeX RDF
24	Sankardeep Chakraborty, Venkatesh Raman 0001, Srinivasa Rao Satti	Biconnectivity, st-numbering and other applications of DFS using O(n) bits.	J. Comput. Syst. Sci.	2017	DBLP DOI BibTeX RDF
24	Mehran Zareh, Lorenzo Sabattini, Cristian Secchi	Decentralized Biconnectivity Conditions in Multi-robot Systems.	CoRR	2016	DBLP BibTeX RDF
24	Sankardeep Chakraborty, Venkatesh Raman 0001, Srinivasa Rao Satti	Biconnectivity, chain decomposition and $st$-numbering using $O(n)$ bits.	CoRR	2016	DBLP BibTeX RDF
24	Mehran Zareh, Lorenzo Sabattini, Cristian Secchi	Enforcing Biconnectivity in Multi-robot Systems.	CoRR	2016	DBLP BibTeX RDF
24	Sankardeep Chakraborty, Venkatesh Raman 0001, Srinivasa Rao Satti	Biconnectivity, Chain Decomposition and st-Numbering Using O(n) Bits.	ISAAC	2016	DBLP DOI BibTeX RDF
24	Mehran Zareh, Lorenzo Sabattini, Cristian Secchi	Decentralized biconnectivity conditions in multi-robot systems.	CDC	2016	DBLP DOI BibTeX RDF
24	Mehran Zareh, Lorenzo Sabattini, Cristian Secchi	Enforcing biconnectivity in multi-robot systems.	CDC	2016	DBLP DOI BibTeX RDF
24	Giuseppe Chiapparo, Umberto Ferraro Petrillo, Donatella Firmani, Luigi Laura	Biconnectivity of Social and Web Graphs.	SEBD	2016	DBLP BibTeX RDF
24	Surabhi Jain, N. Sadagopan	Simpler Sequential and Parallel Biconnectivity Augmentation in Trees.	Parallel Process. Lett.	2015	DBLP DOI BibTeX RDF
24	George M. Slota, Kamesh Madduri	Simple parallel biconnectivity algorithms for multicore platforms.	HiPC	2014	DBLP DOI BibTeX RDF
24	Renato E. N. Moraes, Celso C. Ribeiro	Power optimization in ad hoc wireless network topology control with biconnectivity requirements.	Comput. Oper. Res.	2013	DBLP DOI BibTeX RDF
24	Surabhi Jain, N. Sadagopan	Simpler Sequential and Parallel Biconnectivity Augmentation.	CoRR	2013	DBLP BibTeX RDF
24	James Alexander Edwards, Uzi Vishkin	Better speedups using simpler parallel programming for graph connectivity and biconnectivity.	PMAM	2012	DBLP DOI BibTeX RDF
24	N. S. Narayanaswamy, N. Sadagopan	A Novel Data Structure for Biconnectivity, Triconnectivity, and k-Tree Augmentation.	CATS	2011	DBLP BibTeX RDF
24	Ivana Ljubic	A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation.	Networks	2010	DBLP DOI BibTeX RDF
24	Chen Wang, James Willson, Myung Ah Park, Andras Farago, Weili Wu 0001	On dual power assignment optimization for biconnectivity.	J. Comb. Optim.	2010	DBLP DOI BibTeX RDF
24	Yukihide Kohira, Suguru Suehiro, Atsushi Takahashi 0001	A Fast Longer Path Algorithm for Routing Grid with Obstacles Using Biconnectivity Based Length Upper Bound.	IEICE Trans. Fundam. Electron. Commun. Comput. Sci.	2009	DBLP DOI BibTeX RDF
24	Yukihide Kohira, Suguru Suehiro, Atsushi Takahashi 0001	A fast longer path algorithm for routing grid with obstacles using biconnectivity based length upper bound.	ASP-DAC	2009	DBLP DOI BibTeX RDF
24	Giorgio Ausiello, Donatella Firmani, Luigi Laura	Datastream computation of graph biconnectivity: Articulation Points, Bridges, and Biconnected Components.	ICTCS	2009	DBLP BibTeX RDF
24	Bratislav Milic	Distributed biconnectivity testing in Wireless multi-hop networks. (PDF / PS)		2009	RDF
24	Christian Minge, Rong Zhao, Mathias Schweigel	Improved Optical Network Topology Redesign Ensuring Biconnectivity.	AICT	2008	DBLP DOI BibTeX RDF
24	Yung H. Tsin	An improved self-stabilizing algorithm for biconnectivity and bridge-connectivity.	Inf. Process. Lett.	2007	DBLP DOI BibTeX RDF
24	David Pritchard	An Optimal Distributed Edge-Biconnectivity Algorithm	CoRR	2006	DBLP BibTeX RDF
24	Mazda Ahmadi, Peter Stone	A Distributed Biconnectivity Check.	DARS	2006	DBLP DOI BibTeX RDF
24	Tsan-sheng Hsu, Ming-Yang Kao	Optimal Augmentation for Bipartite Componentwise Biconnectivity in Linear Time.	SIAM J. Discret. Math.	2005	DBLP DOI BibTeX RDF
24	Ivana Ljubic, Günther R. Raidl	A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs.	J. Heuristics	2003	DBLP DOI BibTeX RDF
24	Raffaella Gentilini, Alberto Policriti	Biconnectivity on Symbolically Represented Graphs: A Linear Solution.	ISAAC	2003	DBLP DOI BibTeX RDF
24	T. M. Rao, Raghuveer M. Rao, Ferat Sahin, Jason C. Tillett	Evolutionary algorithms for the edge biconnectivity augmentation problem.	SMC	2003	DBLP DOI BibTeX RDF
24	Günther R. Raidl, Ivana Ljubic	Evolutionary local search for the edge-biconnectivity augmentation problem.	Inf. Process. Lett.	2002	DBLP DOI BibTeX RDF
24	Tsan-sheng Hsu	Simpler and faster biconnectivity augmentation.	J. Algorithms	2002	DBLP DOI BibTeX RDF
24	Sandor Kersting, Günther R. Raidl, Ivana Ljubic	A Memetic Algorithm for Vertex-Biconnectivity Augmentation.	EvoWorkshops	2002	DBLP DOI BibTeX RDF
24	Tsan-sheng Hsu, Ming-Yang Kao	Optimal Augmentation for Bipartite Componentwise Biconnectivity in Linear Time	CoRR	2001	DBLP BibTeX RDF
24	Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki	Multigraph augmentation under biconnectivity and general edge-connectivity requirements.	Networks	2001	DBLP DOI BibTeX RDF
24	Ivana Ljubic, Günther R. Raidl	An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problem.	EvoWorkshops	2001	DBLP DOI BibTeX RDF
24	Monika Rauch Henzinger	Improved Data Structures for Fully Dynamic Biconnectivity.	SIAM J. Comput.	2000	DBLP DOI BibTeX RDF
24	Ivana D. Ljubic, Jozef J. Kratica	A genetic algorithm for the biconnectivity augmentation problem.	CEC	2000	DBLP DOI BibTeX RDF
24	Ka Wong Chong, Tak Wah Lam	Approximating Biconnectivity in Parallel.	Algorithmica	1998	DBLP DOI BibTeX RDF
24	Tsan-sheng Hsu, Ming-Yang Kao	A Unifying Augmentation Algorithm for Two-Edge Connectivity and Biconnectivity.	J. Comb. Optim.	1998	DBLP DOI BibTeX RDF
24	Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup	Poly-Logarithmic Deterministic Fully-Dynamic Algorithms for Connectivity, Minimum Spanning Tree, 2-Edge, and Biconnectivity.	STOC	1998	DBLP DOI BibTeX RDF
24	Ka Wong Chong, Tak Wah Lam	Towards More Precise Parallel Biconnectivity Approximation.	ISAAC	1996	DBLP DOI BibTeX RDF
24	Ka Wong Chong, Tak Wah Lam	Improving Biconnectivity Approximation via Local Optimization.	SODA	1996	DBLP DOI BibTeX RDF
24	Monika Rauch Henzinger	Fully Dynamic Biconnectivity in Graphs.	Algorithmica	1995	DBLP DOI BibTeX RDF
24	Ka Wong Chong, Tak Wah Lam	Approximating Biconnectivity in Parallel.	SPAA	1995	DBLP DOI BibTeX RDF
24	Monika Rauch	Improved data structures for fully dynamic biconnectivity.	STOC	1994	DBLP DOI BibTeX RDF
24	Art Kazmierczak, Sridhar Radhakrishnan	An Optimal Distributed Ear Decomposition Algorithm with Applications to Biconnectivity and Outerplanarity Testing.	SPDP	1993	DBLP DOI BibTeX RDF
24	Samir Khuller, Uzi Vishkin	Biconnectivity Approximations and Graph Carvings	STOC	1992	DBLP DOI BibTeX RDF
24	Shing-Tsaan Huang	A New Distributed Algorithm for the Biconnectivity Problem.	ICPP (3)	1989	DBLP BibTeX RDF
24	Peter J. Varman, Kshitij A. Doshi	Determining Biconnectivity on a Systolic Array.	ICPP	1987	DBLP BibTeX RDF
24	Robert Endre Tarjan, Uzi Vishkin	An Efficient Parallel Biconnectivity Algorithm.	SIAM J. Comput.	1985	DBLP DOI BibTeX RDF
24	Yung H. Tsin	Bridge-Connectivity and Biconnectivity Algorithms for Parallel Computer Models.	ICPP	1983	DBLP BibTeX RDF
24	Greg N. Frederickson, Joseph F. JáJá	On the Relationship between the Biconnectivity Augmentation and Traveling Salesman Problems.	Theor. Comput. Sci.	1982	DBLP DOI BibTeX RDF
19	Satyajayant Misra, Seung Don Hong, Guoliang Xue, Jian Tang 0008	Constrained Relay Node Placement in Wireless Sensor Networks to Meet Connectivity and Survivability Requirements.	INFOCOM	2008	DBLP DOI BibTeX RDF
19	Maurizio Pizzonia	Minimum Depth Graph Embeddings and Quality of the Drawings: An Experimental Analysis.	GD	2005	DBLP DOI BibTeX RDF
19	A. Volgenant, C. W. Duin	On Steiner Versions of (bi)Connectivity in Network Problems.	Graphs Comb.	2004	DBLP DOI BibTeX RDF	Bottleneck optimization, Steiner (bi)connectivity, Steiner bipartition, Algorithms, Combinatorial problems
19	Manuel Bodirsky, Denys Duchier, Joachim Niehren, Sebastian Miele	A new algorithm for normal dominance constraints.	SODA	2004	DBLP BibTeX RDF
19	John H. Reif, William L. Scherlis	Deriving Effcient Graph Algorithms.	Verification: Theory and Practice	2003	DBLP DOI BibTeX RDF
19	Keqin Li	Topological Characteristics of Random Multihop Wireless Networks.	ICDCS Workshops	2003	DBLP DOI BibTeX RDF
19	Weifa Liang, Richard P. Brent, Hong Shen	Fully Dynamic Maintenance of k-Connectivity in Parallel.	IEEE Trans. Parallel Distributed Syst.	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
19	Mikkel Thorup, David R. Karger	Dynamic Graph Algorithms with Applications.	SWAT	2000	DBLP DOI BibTeX RDF
19	Janet M. Six, Ioannis G. Tollis	A Framework for Circular Drawings of Networks.	GD	1999	DBLP DOI BibTeX RDF
19	Zhigang Qin, Felix F. Wu, Nathan Law	Designing B-ISDN Network Topologies Using The Genetic Algorithm.	MASCOTS	1997	DBLP DOI BibTeX RDF
19	Edson Cáceres, Frank K. H. A. Dehne, Afonso Ferreira, Paola Flocchini, Ingo Rieping, Alessandro Roncato, Nicola Santoro, Siang W. Song	Efficient Parallel Graph Algorithms For Coarse Grained Multicomputers and BSP.	ICALP	1997	DBLP DOI BibTeX RDF
19	Xiaofeng Han, Pierre Kelsen, Vijaya Ramachandran, Robert Endre Tarjan	Computing Minimal Spanning Subgraphs in Linear Time.	SODA	1992	DBLP BibTeX RDF