***** To join INSNA, visit http://www.insna.org *****

I apologize for what I'm sure is a trivial question, but I'm stumped. I
have a number of acyclical digraphs (representing hierarchies), which
often have multiple paths between the uppermost (originating) and
terminal nodes.

I am comparing these graphs according to the longest path in each
(i.e., "slack" in the chain of command), but have not been able to find
a metric that fits this exact problem. Since I'm sure this can't be the
first time this question has come up, I turn to the SOCNET community for
guidance.

What is the correct terminology for such a metric?

_____________________________________________________________________
SOCNET is a service of INSNA, the professional association for social
network researchers (http://www.insna.org). To unsubscribe, send
an email message to [log in to unmask] containing the line
UNSUBSCRIBE SOCNET in the body of the message.