21. A non-transitory computer readable medium storing computer program instructions for identifying relevant messages in a conversation graph, which, when executed on a processor, cause the processor 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.
23. The computer readable medium of claim 21 , the operations further comprising: identifying as prolific authors any authors that have authored more than a particular number of messages; and marking messages authored by the prolific authors as relevant.