Step 1: - first search for write operation coming in schedule going sequentially
Step 2 : - traverse first left of that Write and Look for following
i. Read operation on same data item
ii. Whether operation is performed by same transaction or not.
a) If same transaction continue traversing or
b) if different transaction, draw a edge from reading transaction to writing transaction
iii. Traverse till you reach first operation in reverse sequence and perform step 2.i and 2.ii
Step 3 :- traverse right to the Write operation we selected in previous step and check for same step 2.i and 2.ii on reaching step "2.ii.b" this time draw a edge from writing transaction and to reading transaction
Step 4 :- repeat the steps 2 and 3 with the selected write operation by a particular transaction but this time look for write operation performed by some other transaction on same varialble as our selected transaction.
Step 5. Finally take a look at graph we got. If anywhere in the graph you find cycle its not conflict serializable. If no cycle, its conflict serializable
Hope this helps...
