| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 3 | 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 |
| 2 | Balázs Szegedy, Christian Szegedy |
Symplectic Spaces And Ear-Decomposition Of Matroids. |
Combinatorica |
2006 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C70, 05C85, 05C50 |
| 2 | Sing-Ling Lee, Jung-Chun Liu, YuChing Chen |
An Ear-Decomposition Based Approach for Survivable Routing in WDM Networks. |
AINA |
2005 |
DBLP DOI BibTeX RDF |
|
| 2 | Heping Zhang |
Regular Coronoids and Ear Decompositions of Plane Elementary Bipartite Graphs. |
CJCDGCGT |
2005 |
DBLP DOI BibTeX RDF |
Regular coronoid, normal coronoid, plane elementary bipartite graph, regular decomposition, perfect matching, ear decomposition |
| 2 | Lars Arge, Laura Toma, Norbert Zeh |
I/O-efficient topological sorting of planar DAGs. |
SPAA |
2003 |
DBLP DOI BibTeX RDF |
I/O-efficient algorithms, planar directed graphs, graph algorithms, topological sorting, ear decomposition |
| 2 | Harold N. Gabow |
An ear decomposition approach to approximating the smallest 3-edge connected spanning subgraph of a multigraph. |
SODA |
2002 |
DBLP DOI BibTeX RDF |
|
| 2 | Louis Ibarra, Dana S. Richards |
Efficient Parallel Graph Algorithms Based on Open Ear Decomposition. |
MFCS |
1993 |
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 |
| 1 | Jay Schweig |
A Convex-Ear Decomposition for Rank-Selected Subposets of Supersolvable Lattices. |
SIAM J. Discrete Math. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Satoru Iwata, Takuro Matsuda |
Finding coherent cyclic orders in strong digraphs. |
Combinatorica |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 05C20, 90C27 |
| 1 | Marcelo H. de Carvalho, Joseph Cheriyan |
An O(VE) algorithm for ear decompositions of matching-covered graphs. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcelo H. de Carvalho, Joseph Cheriyan |
An O(VE) algorithm for ear decompositions of matching-covered graphs. |
ACM Transactions on Algorithms |
2005 |
DBLP DOI BibTeX RDF |
Matching theory, ear decompositions |
| 1 | Yung H. Tsin |
On finding an ear decomposition of an undirected graph distributively. |
Inf. Process. Lett. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Harold N. Gabow |
An Ear Decomposition Approach to Approximating the Smallest 3-Edge Connected Spanning Subgraph of a Multigraph. |
SIAM J. Discrete Math. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Yung H. Tsin |
An Efficient Distributed Algorithm for Ear Decomposition. |
MSV/AMCS |
2004 |
DBLP BibTeX RDF |
|
| 1 | Kathryn L. Nyman, Ed Swartz |
Inequalities for the h-Vectors and Flag h-Vectors of Geometric Lattices. |
Discrete & Computational Geometry |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Chuan-Ching Sue, Sy-Yen Kuo |
Restoration from Multiple Faults in WDM Networks without Wavelength Conversion. |
ICN |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Deborah S. Franzblau |
Generic rigidity of molecular graphs via ear decomposition. |
Discrete Applied Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei Kotlov |
Spectral Characterization of Tree-Width-Two Graphs. |
Combinatorica |
2000 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 05 |
| 1 | Deborah S. Franzblau |
Ear Decomposition with Bounds on Ear Length. |
Inf. Process. Lett. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Zoltán Szigeti |
On Optimal Ear-Decompositions of Graphs. |
IPCO |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcelo H. de Carvalho, Cláudio Leonardo Lucchesi, Uppaluri S. R. Murty |
Ear Decompositions of Matching Covered Graphs. |
Combinatorica |
1999 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 05C70 |
| 1 | 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 |
|
| 1 | Louis Ibarra, Dana S. Richards |
Tree Open Ear Decomposition in Parallel Graph Algorithms. |
Parallel Processing Letters |
1995 |
DBLP BibTeX RDF |
|
| 1 | Ying-Min Huang, Joseph JáJá |
An Optimal Ear Decomposition Algorithm with Applications on Fixed-Size Linear Arrays. |
ICPP |
1995 |
DBLP BibTeX RDF |
|
| 1 | Sun-Yuan Hsieh, Chin-Wen Ho |
An Efficient Parallel Strategy for Recognizing Series-Parallel Graphs. |
ISAAC |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Louis Ibarra, Dana S. Richards |
Efficient Parallel Graph Algorithms Based on Open Ear Decomposition. |
Parallel Computing |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Sridhar Hannenhalli, Kalyan S. Perumalla, N. Chandrasekharan, R. Sridhar |
A Distributed Algorithm for Ear Decomposition. |
ICCI |
1993 |
DBLP BibTeX RDF |
|
| 1 | Art Kazmierczak, Sridhar Radhakrishnan |
An Optimal Distributed Ear Decomposition Algorithm with Applications to Biconnectivity and Outerplanarity Testing. |
SPDP |
1993 |
DBLP BibTeX RDF |
|
| 1 | Jianer Chen, Saroja P. Kanchi |
Graph Ear Decompositions and Graph Embeddings (Extended Abstract). |
WG |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Hillel Gazit |
Optimal EREW Parallel Algorithms for Connectivity, Ear Decomposition and st-Numbering of Planar Graphs. |
IPPS |
1991 |
DBLP BibTeX RDF |
|
| 1 | Vijaya Ramachandran, John H. Reif |
An Optimal Parallel Algorithm for Graph Planarity (Extended Abstract) |
FOCS |
1989 |
DBLP DOI BibTeX RDF |
graph planarity, open ear decomposition, embedding, graph connectivity, CRCW PRAM, optimal parallel algorithm |
| 1 | David Eppstein, Zvi Galil |
Parallel Algorithmic Techniques for Combinatorial Computation. |
ICALP |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Donald S. Fussell, Vijaya Ramachandran, Ramakrishna Thurimella |
Finding Triconnected Components by Local Replacements. |
ICALP |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Vijaya Ramachandran |
A Framework for Parallel Graph Algorithm Design. |
Optimal Algorithms |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Donald S. Fussell, Ramakrishna Thurimella |
Successive Approximation in Parallel Graph Algorithms. |
STACS |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Yael Maon, Baruch Schieber, Uzi Vishkin |
Parallel Ear Decomposition Search (EDS) and st-Numbering in Graphs. |
Theor. Comput. Sci. |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Yael Maon, Baruch Schieber, Uzi Vishkin |
Parallel Ear Decomposition Search (EDS) and St-Numbering in Graphs (Extended Abstract). |
Aegean Workshop on Computing |
1986 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")