New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Test for chordal graph, find perfect elimination ordering #6

Open

dgleich opened this issue Jan 23, 2011 · 0 comments

Owner

dgleich commented Jan 23, 2011

Would be great to be able to test whether a graph is chordal (no chordless cycles longer than 3 nodes).

For chordal graphs, it would then be useful to be able to compute a perfect elimination ordering.

Ref: http://en.wikipedia.org/wiki/Chordal_graph

Many thanks,
Ged

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment