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.
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. 29. The computer readable medium of claim 21 wherein the operation of identifying a context message within the conversation graph is by one of a message selected by a user, a message including one of a specific keyword and a topic, a message returned in response to a search request, a message associated with an advertisement, and a message included in a conversation graph.