What is the order of growth of the memory used to represent a graph with V vertices and E edges using the adjacency-lists representation?

In a graph G represented using adjacency-lists, depth-first search marks all vertices connected to s in time proprotional to:

In undirected graphs, the *is connected to* relation is:

Which one of the following graph-processing problems is unlikely to have an algorithm whose running time is E+V?