What is the fastest graph implementation for removing and adding vertices?
It seems like this part of my C compiler is the slowest, and can take up to 9/10 ms per vertex removed (which is a really long time when there are something like 60,000 vertices in the graph).
If not is there some way to do maximum cardinality search (for simplicial elimination ordering construction) without removing vertices?