Ear decomposition

Known as: Ear 
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)
Wikipedia

Topic mentions per year

Topic mentions per year

1979-2016
024619792016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
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
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
In WDM-based network, a single fiber abortion may cause many logical lightpaths failures such that embedded logical topology of a… (More)
  • table 3
  • table 1
  • table 2
  • figure 2
  • figure 3
Is this relevant?
2004
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)
  • figure 1
Is this relevant?
2002
2002
This paper gives a 3/2 approximation algorithm for the smallest 3-edge connected spanning subgraph of an undirected multigraph… (More)
  • figure 2
Is this relevant?
1999
1999
Ear decomposition of a graph has been extensively studied in relation to graph connectivity. In this paper, a connection of ear… (More)
  • figure 2.1
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)
  • figure 3.1
  • figure 3.2
  • figure 3.3
  • figure 4.1
  • figure 4.2
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
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?