1. A method for identifying relevant messages in a conversation graph, comprising: a) identifying, by a computer processor, a context message within the conversation graph; b) marking, by the computer processor, the context message as relevant; c) identifying, by the computer processor, a plurality of authors of messages marked as relevant; d) identifying, by the computer processor and in the conversation graph, a plurality of unmarked messages authored by the plurality of authors; e) marking, by the computer processor, the plurality of unmarked messages as relevant; f) identifying, by the computer processor and in the conversation graph, a plurality of parent messages of messages marked as relevant; g) marking, by the computer processor, the plurality of parent messages as relevant; and h) providing a list comprising the messages marked as relevant.
1. A method for identifying relevant messages in a conversation graph, comprising: a) identifying, by a computer processor, a context message within the conversation graph; b) marking, by the computer processor, the context message as relevant; c) identifying, by the computer processor, a plurality of authors of messages marked as relevant; d) identifying, by the computer processor and in the conversation graph, a plurality of unmarked messages authored by the plurality of authors; e) marking, by the computer processor, the plurality of unmarked messages as relevant; f) identifying, by the computer processor and in the conversation graph, a plurality of parent messages of messages marked as relevant; g) marking, by the computer processor, the plurality of parent messages as relevant; and h) providing a list comprising the messages marked as relevant. 4. The method of claim 1 further comprising: identifying as credible authors any authors that have author credibility above a threshold; and marking messages authored by the credible authors as relevant.