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
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