2 citations · 3 across the 2 of their papers we have counts for
3 papers
cs.HC2018★ 2 cited
Large Graph Exploration via Subgraph Discovery and Decomposition
James Abello, Fred Hohman, Varun Bezzam +1
We are developing an interactive graph exploration system called Graph Playground for making sense of large graphs. Graph Playground offers a fast and scalable edge decomposition a…
cs.IR2015★ 1 cited
Seeing the Forest through the Trees: Adaptive Local Exploration of Large Graphs
Robert Pienta, Zhiyuan Lin, Minsuk Kahng +5
Visualization is a powerful paradigm for exploratory data analysis. Visualizing large graphs, however, often results in a meaningless hairball. In this paper, we propose a differen…
cs.DS2012
MSOL Restricted Contractibility to Planar Graphs
James Abello, Pavel Klavík, Jan Kratochvíl +1
We study the computational complexity of graph planarization via edge contraction. The problem CONTRACT asks whether there exists a set of at most edges that when contracte…