Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
What do you call a graph that’s almost an arborescence, but where the edges go in the opposite direction? That is, a directed graph with a center node, where every node has exactly one path to the center?
It might help to have a reason for naming this thing. I’m looking to describe the control structure used in a continuation passing architecture. If the structure is called a “romefuz”, we could say that continuation passing uses a call-romefuz rather than a call-stack.
I don’t know of a single-word term for the reverse of an arborescence, but I think it is good enough to just use “reverse arborescence”. (The Wikipedia entry provides citations for converse, transpose, and reverse, of which I think reverse sounds the best, but surely you could also pick either of the other two. Perhaps converse sounds a bit more rigorous; lay people are less likely to use it. But then, lay people wouldn’t really be talking about arborescences in the first place, would they?)