A lower bound for distributed averaging algorithms on the line graph by Tsitsiklis, John N., Olshevsky, Alexander

Get full text
Get full text

Complexity as a Sclae-Space for the Medial Axis Transform by Chaney, Ronald

“…The medial axis skeleton is a thin line graph that preserves the topology of a region. …”
Get full text

Meshes Preserving Minimum Feature Size by Aloupis, Greg, Demaine, Erik D., Demaine, Martin L., Dujmovic, Vida, Iacono, John

“…The minimum feature size of a planar straight-line graph is the minimum distance between a vertex and a nonincident edge. …”
Get full text
Get full text

Information Design Considerations for Effective Communication of Sustainability Metrics by Sternberg, Zachary

“…But why is it that designers assume people are able to know how to understand the spikes and dips in a time-based line graph and draw the connection to their heating and air-conditioning or an inefficient dryer in the laundry room? …”
Get full text
Get full text

A minimum degree condition forcing complete graph immersion by Devos, Matt, Fox, Jacob, McDonald, Jessica, Mohar, Bojan, Scheide, Diego, Dvorak, Zdenek

“…As an application of these results, we resolve a problem raised by Paul Seymour by proving that the line graph of every simple graph with average degree d has a clique minor of order at least cd [superscript 3/2], where c>0 is an absolute constant. …”
Get full text