Algorithms on graphs, excluding heuristics.
Any algorithm on graphs for which correctness and complexity can be analysed is proper for this tag.
For heuristics about graph problems that can not be analysed in theory, heuristics is more appropriate. Problems about properties of graphs should be tagged graph-theory. Problems about general algorithms (not specifically about graphs) should be tagged ds.algorithms.