| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 4 | Bala Swaminathan, Kenneth J. Goldman |
An Incremental Distributed Algorithm for Computing Biconnected Components in Dynamic Graphs.  |
Algorithmica  |
1998 |
DBLP DOI BibTeX RDF |
Distributed graph algorithms, Distributed graph algorithms, Key words, Dynamic configuration, Dynamic configuration, Biconnected components, Biconnected components |
| 3 | Bala Swaminathan, Kenneth J. Goldman |
An Incremental Distributed Algorithm for Computing Biconnected Components (Extended Abstract).  |
WDAG  |
1994 |
DBLP DOI BibTeX RDF |
distributed graph algorithms, dynamic configuration, biconnected components |
| 2 | Raffaella Gentilini, Carla Piazza, Alberto Policriti |
Symbolic Graphs: Linear Solutions to Connectivity Related Problems.  |
Algorithmica  |
2008 |
DBLP DOI BibTeX RDF |
Massive graphs, Model checking, Ordered binary decision diagrams, Biconnected components, Strongly connected components |
| 2 | Daniel Archambault, Tamara Munzner, David Auber |
Smashing Peacocks Further: Drawing Quasi-Trees from Biconnected Components.  |
IEEE Trans. Vis. Comput. Graph.  |
2006 |
DBLP DOI BibTeX RDF |
Graph and Network Visualization, Quasi-Tree |
| 2 | Guojing Cong, David A. Bader |
An Experimental Study of Parallel Biconnected Components Algorithms on Symmetric Multiprocessors (SMPs).  |
IPDPS  |
2005 |
DBLP DOI BibTeX RDF |
|
| 2 | Amitava Datta |
Efficient Graph-Theoretic Algorithms on a Linear Array with a Reconfigurable Pipelined Bus System.  |
The Journal of Supercomputing  |
2002 |
DBLP DOI BibTeX RDF |
reconfigurable pipelined bus, minimum spanning forest, parallel algorithm, graph algorithms, connected components, optical computing, biconnected components |
| 2 | Juan F. Arias, Atul K. Chhabra, Vishal Misra |
Interpreting and representing tabular documents.  |
CVPR  |
1996 |
DBLP DOI BibTeX RDF |
tabular documents, telephone company DSX assignment table drawings, run-length encoded representation, tabular structures, document image processing, document handling, biconnected components |
| 2 | Tzong-Wann Kao, Shi-Jinn Horng |
Computing Dominators and Its Applications on Processor Arrays with Reconfigurable Bus Systems.  |
ISPAN  |
1996 |
DBLP DOI BibTeX RDF |
bridge-connected components, reconfigurable bus system, dominator, undirected graphs, bridge, dominator tree, biconnected components, articulation point |
| 2 | Eliezer Dekel, Jie Hu |
Parallel Pruning Decomposition (PDS) and Biconnected Components of Graphs.  |
CIAC  |
1994 |
DBLP DOI BibTeX RDF |
|
| 2 | Zvi Galil, Giuseppe F. Italiano |
Maintaining Biconnected Components of Dynamic Planar Graphs.  |
ICALP  |
1991 |
DBLP DOI BibTeX RDF |
|
| 2 | Kwan Woo Ryu, Joseph JáJá |
Efficient Algorithms for List Ranking and for Solving Graph Problems on the Hypercube.  |
IEEE Trans. Parallel Distrib. Syst.  |
1990 |
DBLP DOI BibTeX RDF |
linear speedup, basic graph problems, tree expression evaluation, st-numbering, one-port communication, parallel algorithms, computational complexity, load balancing, graph theory, sorting, sorting, graph algorithms, biconnected components, list ranking, graph problems, hypercube algorithm, hypercube algorithms, ear decomposition |
| 2 | Biing-Feng Wang, Gen-Huey Chen |
Constant Time Algorithms for the Transitive Closure and Some Related Graph Problems on Processor Arrays with Reconfigurable Bus Systems.  |
IEEE Trans. Parallel Distrib. Syst.  |
1990 |
DBLP DOI BibTeX RDF |
related graph problems, reconfigurable bus systems, parallel algorithms, graph theory, minimum spanning trees, bipartite graphs, transitive closure, transitive closure, connected components, processor arrays, undirected graph, bridges, biconnected components, graph problems, articulation points |
| 2 | Robert Endre Tarjan, Uzi Vishkin |
Finding Biconnected Components and Computing Tree Functions in Logarithmic Parallel Time (Extended Summary)  |
FOCS  |
1984 |
DBLP DOI BibTeX RDF |
spanning tree, blocks, biconnected components, parallel graph algorithm |
| 1 | Giorgio Ausiello, Donatella Firmani, Luigi Laura |
Real-time monitoring of undirected networks: Articulation points, bridges, and connected and biconnected components.  |
Networks  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Giorgio Ausiello, Donatella Firmani, Luigi Laura |
Real-Time Monitoring of Undirected Networks: Articulation Points, Bridges, and Connected and Biconnected Components  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Giorgio Ausiello, Donatella Firmani, Luigi Laura |
Datastream computation of graph biconnectivity: Articulation Points, Bridges, and Biconnected Components.  |
ICTCS  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Thilo Streichert, Michael Glaß, Rolf Wanka, Christian Haubelt, Jürgen Teich |
Topology-Aware Replica Placement in Fault-Tolerant Embedded Networks.  |
ARCS  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Guojing Cong, David A. Bader |
Techniques for Designing Efficient Parallel Graph Algorithms for SMPs and Multicore Processors.  |
ISPA  |
2007 |
DBLP DOI BibTeX RDF |
Shared Memory, Spanning Tree, Minimum Spanning Tree, Biconnected Components |
| 1 | Kathryn Francis, Peter J. Stuckey |
Constraint propagation for loose constraint graphs.  |
SAC  |
2007 |
DBLP DOI BibTeX RDF |
constraint graph, constraint propagation |
| 1 | Guowei Wu, Kai Yao |
A Graph-Theory Algorithm for WCET Estimation.  |
International Conference on Computational Science  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Camil Demetrescu, Bruno Escoffier, Gabriel Moruz, Andrea Ribichini |
Adapting Parallel Algorithms to the W-Stream Model, with Applications to Graph Problems.  |
MFCS  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Nguyen Bao Nguyen, C. Thach Nguyen, Wing-Kin Sung |
Fast algorithms for computing the tripartition-based distance between phylogenetic networks.  |
J. Comb. Optim.  |
2007 |
DBLP DOI BibTeX RDF |
Tripartition-based distance, Algorithm, Phylogenetic network |
| 1 | Maurizio Pizzonia |
Minimum Depth Graph Embeddings and Quality of the Drawings: An Experimental Analysis.  |
Graph Drawing  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Nguyen Bao Nguyen, C. Thach Nguyen, Wing-Kin Sung |
Fast Algorithms for Computing the Tripartition-Based Distance Between Phylogenetic Networks.  |
ISAAC  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Stavros D. Nikolopoulos, Leonidas Palios |
On the Strongly Connected and Biconnected Components of the Complement of Graphs.  |
Electronic Notes in Discrete Mathematics  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Stavros D. Nikolopoulos, Leonidas Palios |
On the Strongly Connected and Biconnected Components of the Complement of Graphs.  |
CTW  |
2004 |
DBLP BibTeX RDF |
|
| 1 | Frank Kammer, Hanjo Täubig |
Connectivity.  |
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 |
|
| 1 | Patrick Healy, Karol Lynch |
Building Blocks of Upward Planar Digraphs.  |
Graph Drawing  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Raffaella Gentilini, Alberto Policriti |
Biconnectivity on Symbolically Represented Graphs: A Linear Solution.  |
ISAAC  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Mehmet Hakan Karaata |
A Stabilizing Algorithm for Finding Biconnected Components.  |
J. Parallel Distrib. Comput.  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Irit Katriel, Ulrich Meyer |
Elementary Graph Algorithms in External Memory.  |
Algorithms for Memory Hierarchies ![In: Algorithms for Memory Hierarchies, Advanced Lectures [Dagstuhl Research Seminar, March 10-14, 2002], pp. 62-84, 2002, Springer, 3-540-00883-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean-François Baget, Yannic S. Tognetti |
Backtracking Through Biconnected Components of a Constraint Graph.  |
IJCAI  |
2001 |
DBLP BibTeX RDF |
|
| 1 | Harold N. Gabow |
Path-based depth-first search for strong and biconnected components.  |
Inf. Process. Lett.  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Art Kazmierczak, Sridhar Radhakrishnan |
An Optimal Distributed Ear Decomposition Algorithm with Applications to Biconnectivity and Outerplanarity Testing.  |
IEEE Trans. Parallel Distrib. Syst.  |
2000 |
DBLP DOI BibTeX RDF |
biconnectivity testing, outerplanarity testing, Distributed algorithm, message complexity, depth first search, ear decomposition |
| 1 | Maurizio Pizzonia, Roberto Tamassia |
Minimum Depth Graph Embedding.  |
ESA  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Jungho Park, JeongBae Lee, Toshimitsu Masuzawa, HyungSik Choi |
An Efficient Distributed Algorithm for the Biconnected-components Updating Problem.  |
PDPTA  |
1999 |
DBLP BibTeX RDF |
|
| 1 | Mehmet Hakan Karaata, Pranay Chaudhuri |
A Self-Stabilizing Algorithm for Bridge Finding.  |
Distributed Computing  |
1999 |
DBLP DOI BibTeX RDF |
Distributed systems, Self-stabilization, Bridge, Biconnected components |
| 1 | Ramakrishna Thurimella |
Sub-Linear Distributed Algorithms for Sparse Certificates and Biconnected Components.  |
J. Algorithms  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Weifa Liang, George Havas |
NC Approximation Algorithms for 2-Connectivity Augmentation in a Graph.  |
Euro-Par  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Y. Daniel Liang, Chongkye Rhee |
Finding Biconnected Components in O(n) Time for a Class of Graphs.  |
Inf. Process. Lett.  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | K. Madhukar, D. Pavan Kumar, C. Pandu Rangan, R. Sundar |
Systematic Design of an Algorithm for Biconnected Components.  |
Sci. Comput. Program.  |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Ramakrishna Thurimella |
Sub-linear Distributed Algorithms for Sparse Certificates and Biconnected Components (Extended Abstract).  |
PODC  |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Y. Daniel Liang, Chongkye Rhee |
An Optimal Algorithm for Finding Biconnected Components in Permutation Graphs.  |
ACM Conference on Computer Science  |
1995 |
DBLP DOI BibTeX RDF |
algorithm, breadth-first search, biconnected component, permutation graph |
| 1 | Dorit S. Hochbaum |
Why Should Biconnected Components be Identified First.  |
Discrete Applied Mathematics  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Denis Martin, Nicholas C. Rumin |
Delay prediction from resistance-capacitance models of general MOS circuits.  |
IEEE Trans. on CAD of Integrated Circuits and Systems  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeffery Westbrook, Robert Endre Tarjan |
Maintaining Bridge-Connected and Biconnected Components On-Line.  |
Algorithmica  |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Jinwoon Woo, Sartaj Sahni |
Computing biconnected components on a hypercube.  |
The Journal of Supercomputing  |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Walter Hohberg |
How to Find Biconnected Components in Distributed Networks.  |
J. Parallel Distrib. Comput.  |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohan Ahuja, Yahui Zhu |
An Efficient Distributed Algorithm for Finding Articulation Points, Bridges, and Biconnected Components in Asynchronous Networks.  |
FSTTCS  |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Kshitij Doshi, Peter J. Varman |
Efficient Graph Algorithm Using Limited Communication on a Fixed-Size Array of Processors.  |
STACS  |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Manfred Wiegers |
Recognizing Outerplanar Graphs in Linear Time.  |
WG  |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | David Maier, Jeffrey D. Ullman |
Connections in Acyclic Hypergraphs.  |
PODS  |
1982 |
DBLP DOI BibTeX RDF |
|