11. A system for identifying relevant messages in a conversation graph, the system comprising: a computer processor; and a conversation module executing on the computer processor and configured to perform operations comprising: a) identifying a context message within the conversation graph; b) marking the context message as relevant; c) identifying a plurality of authors of messages marked as relevant; d) identifying, in the conversation graph, a plurality of unmarked messages authored by the plurality of authors; e) marking the plurality of unmarked messages as relevant; f) identifying, in the conversation graph, a plurality of parent messages of messages marked as relevant; g) marking the plurality of parent messages as relevant; and h) providing a list comprising the messages marked as relevant.
11. A system for identifying relevant messages in a conversation graph, the system comprising: a computer processor; and a conversation module executing on the computer processor and configured to perform operations comprising: a) identifying a context message within the conversation graph; b) marking the context message as relevant; c) identifying a plurality of authors of messages marked as relevant; d) identifying, in the conversation graph, a plurality of unmarked messages authored by the plurality of authors; e) marking the plurality of unmarked messages as relevant; f) identifying, in the conversation graph, a plurality of parent messages of messages marked as relevant; g) marking the plurality of parent messages as relevant; and h) providing a list comprising the messages marked as relevant. 12. The system of claim 11 wherein the operations c), d), e), f), and g) are repeated until convergence and then operation h) is performed.