You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Is your feature request related to a problem? Please describe.
A common approach to implement optimized triangle enumeration/counting is to include only the edges that are part of the 2-core subgraph and from the lower degree vertex to the higher degree vertex vertices (with a tie breaking mechanism if source & destination have a same degree).
We need an edge filtering mechanism based on source & destination properties (source & destination properties will be the degree in the 2-core subgraph).
Describe the solution you'd like
We need an API similar to our extract induced subgraph implementation; but with a mechanism to pass custom source/destination properties and a filtering op.
The text was updated successfully, but these errors were encountered:
Is your feature request related to a problem? Please describe.
A common approach to implement optimized triangle enumeration/counting is to include only the edges that are part of the 2-core subgraph and from the lower degree vertex to the higher degree vertex vertices (with a tie breaking mechanism if source & destination have a same degree).
We need an edge filtering mechanism based on source & destination properties (source & destination properties will be the degree in the 2-core subgraph).
Describe the solution you'd like
We need an API similar to our extract induced subgraph implementation; but with a mechanism to pass custom source/destination properties and a filtering op.
The text was updated successfully, but these errors were encountered: