# Get (l,r)-core of a directed graph - simultaneously determined degree set

GROUPS:
 Dear all,I have a directed graph G with 10,000 nodes. I am interested in identifying (l,r)-cores of G where l and r denote the in-degree and the out-degree of G, respectively. Mathematica has already developed separately: KCoreComponents[G,k] KCoreComponents[G, 3, "In"] for in-degree for k=3 KCoreComponents[G, 3, "Out"] for out-degree for k=3The above codes separately finds the in and out-degrees. I am interested in finding SIMULTANEOUSLY the (l,r)-cores of G. Any idea about developing a code for this simultaneous determination of the cores?Thanks. Temel