This post has been de-listed
It is no longer included in search results and normal feeds (front page, hot posts, subreddit posts, etc). It remains visible only via the author's post history.
3
Complexity measure of hierarchical graphs
Post Body
Working on a particular problem for a project of mine, does anyone here have a good complexity measure of nested graphs? That is, a graph where each node could be a subgraph ? Can assume all graphs are directed acyclic.
Initial thoughts include nested entropy or rather just piling up individual complexity, but that somehow fails to capture the depth, but one could maybe scale with the depth to accommodate it (seems rather arbitrary).
Author
Account Strength
50%
Account Age
6 years
Verified Email
No
Verified Flair
No
Total Karma
60
Link Karma
40
Comment Karma
20
Profile updated: 3 days ago
Posts updated: 3 weeks ago
Subreddit
Post Details
We try to extract some basic information from the post title. This is not
always successful or accurate, please use your best judgement and compare
these values to the post title and body for confirmation.
- Posted
- 1 month ago
- Reddit URL
- View post on reddit.com
- External URL
- reddit.com/r/math/commen...