Convex partitioning algorithm #7446
CristianTirelli
started this conversation in
General
Replies: 1 comment
-
I'm not familiar with the literature for finding p-convex sub-graphs. From the paper you linked to, it seems that even checking if a subgraph is p-convex is difficult. That paper proposes an algorithm for deciding is a co-graph is p-convex. So it sounds like there is a lot of work to be done to get what you ask for: "extract |
Beta Was this translation helpful? Give feedback.
0 replies
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
-
Hi all,
I'm looking into the docs for an algorithm that is able to extract
n
convex sub-graphs from a directed/undirected graph, but I wasn't able to find anything.Do we have something similar in networkx?
This is very close to what I was looking for.
Beta Was this translation helpful? Give feedback.
All reactions