31 citations · 58 across the 10 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.DS2014
Tree decompositions and social graphs
Aaron B. Adcock, Blair D. Sullivan, Michael W. Mahoney
Recent work has established that large informatics graphs such as social and information networks have non-trivial tree-like structure when viewed at moderate size scales. Here, we…
cs.CC2014
Zig-Zag Numberlink is NP-Complete
Aaron Adcock, Erik D. Demaine, Martin L. Demaine +4
When can terminal pairs in an grid be connected by vertex-disjoint paths that cover all vertices of the grid? We prove that this problem is NP-complete. Our ha…