Re: Computing cut nodes and bridges in directed graphs

From: "Gene" <eugene.ressler@xxxxxxxxxxxxxxx>
Date: 10 Aug 2005 19:43:59 -0700

Luis,
Now that I understand better what you are trying to do, I think you
want to look at the literature on dominators and dominator graphs.
These are most often used in compiler optimizations.

.

Follow-Ups:
- Re: Computing cut nodes and bridges in directed graphs
  - From: Luis Quesada

References:
- Computing cut nodes and bridges in directed graphs
  - From: Luis Quesada
- Re: Computing cut nodes and bridges in directed graphs
  - From: Gene
- Re: Computing cut nodes and bridges in directed graphs
  - From: Luis Quesada
- Re: Computing cut nodes and bridges in directed graphs
  - From: Gene
- Re: Computing cut nodes and bridges in directed graphs
  - From: Luis Quesada
- Re: Computing cut nodes and bridges in directed graphs
  - From: Luis Quesada
- Re: Computing cut nodes and bridges in directed graphs
  - From: Gene
- Re: Computing cut nodes and bridges in directed graphs
  - From: Luis Quesada

Prev by Date: Re: asymptotic behaviour of multivariate recurrence equations?
Next by Date: Re: Efficient way to store an isomorphism?
Previous by thread: Re: Computing cut nodes and bridges in directed graphs
Next by thread: Re: Computing cut nodes and bridges in directed graphs
Index(es):
- Date
- Thread