Flow smoothing and denoising: graph signal processing in the edge-space by Schaub, M, Segarra, S

“…Moreover, we show how these new filters can be combined with more classical Laplacian-based processing methods on the line-graph. Finally, we illustrate the developed tools by denoising synthetic traffic flows on the London street network.…”

Counting and finding homomorphisms is universal for parameterized complexity theory by Roth, M, Wellnitz, P

“…Those classes include line graphs, claw-free graphs, perfect graphs, and combinations thereof, and F-colorable graphs for fixed graphs F. …”