Test for chordal graph, find perfect elimination ordering

Bug #610390 reported by Ged Ridgway
6
This bug affects 1 person
Affects Status Importance Assigned to Milestone
Matlab BGL
Incomplete
Wishlist
Unassigned

Bug Description

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

David Gleich (dgleich)
Changed in matlab-bgl:
importance: Undecided → Wishlist
status: New → Incomplete
Revision history for this message
David Gleich (dgleich) wrote :

Ideally, these routines require full boost support. It'd be interesting to see if the is.triangulated from the RBGL package could easily be incorporated.

To post a comment you must log in.
This report contains Public information  
Everyone can see this information.

Other bug subscribers

Related questions

Remote bug watches

Bug watches keep track of this bug in other bug trackers.