In graph theory, an ear of an undirected graph G is a path P where the two endpoints of the path may coincide, but where otherwise no repetition ofâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2009

2009

- Russ Woodroofe
- Electr. J. Comb.
- 2009

We consider the problem of constructing a convex ear decomposition for a poset. The usual technique, introduced by Nyman andâ€¦Â (More)

Is this relevant?

2006

2006

- BalÃ¡zs Szegedy, Christian Szegedy
- Combinatorica
- 2006

Matroids admitting an odd ear-decomposition can be viewed as natural generalizations of factor-critical graphs. We prove that aâ€¦Â (More)

Is this relevant?

2005

2005

- Sing-Ling Lee, Jung-Chun Liu, YuChing Chen
- 19th International Conference on Advancedâ€¦
- 2005

In WDM-based network, a single fiber abortion may cause many logical lightpaths failures such that embedded logical topology of aâ€¦Â (More)

Is this relevant?

2004

2004

- Yung H. Tsin
- Inf. Process. Lett.
- 2004

An ear decomposition of a connected undirected graph G= (V ,E) is a partition of the edge (link) set E into a collection of edgeâ€¦Â (More)

Is this relevant?

2002

2002

- Harold N. Gabow
- SODA
- 2002

This paper gives a 3/2 approximation algorithm for the smallest 3-edge connected spanning subgraph of an undirected multigraphâ€¦Â (More)

Is this relevant?

1999

1999

- Jianer Chen, Saroja P. Kanchi
- SIAM J. Discrete Math.
- 1999

Ear decomposition of a graph has been extensively studied in relation to graph connectivity. In this paper, a connection of earâ€¦Â (More)

Is this relevant?

Review

1996

Review

1996

We show how to decompose e ciently in parallel any graph into a number, ~ , of outerplanar subgraphs (called hammocks) satisfyingâ€¦Â (More)

Is this relevant?

1992

1992

This report deals with a parallel algorithmic technique that has proved to be very useful in the design of eecient parallelâ€¦Â (More)

Is this relevant?

1991

1991

- Hillel Gazit
- IPPS
- 1991

Parallel ERE W deterministic algorithms for finding the connected components, ear decomposition and stnumbering of a planar graphâ€¦Â (More)

Is this relevant?

1986

1986

LEC-67] linear time serial algorithm for testing planarity of graphs uses the linear time serial algorithm of [ET-76] for stâ€¦Â (More)

Is this relevant?