Sciweavers

5889 search results - page 139 / 1178
» Graph Layout Problems
Sort
View
133
Voted
SODA
2010
ACM
235views Algorithms» more  SODA 2010»
15 years 11 months ago
Algorithmic Lower Bounds for Problems Parameterized by Clique-width
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtano...
137
Voted
ISPAN
2008
IEEE
15 years 8 months ago
Product Line Sigraphs
Intuitively, a signed graph is a graph in which every edge is labeled with a + or − sign. For each edge, its sign represents the mode of the relationship between the vertices it...
Daniela Ferrero
164
Voted
APVIS
2011
14 years 2 months ago
Multilevel agglomerative edge bundling for visualizing large graphs
Graphs are often used to encapsulate relationships between objects. Node-link diagrams, commonly used to visualize graphs, suffer from visual clutter on large graphs. Edge bundlin...
Emden R. Gansner, Yifan Hu, Stephen C. North, Carl...
115
Voted
TVCG
2012
196views Hardware» more  TVCG 2012»
13 years 4 months ago
Ambiguity-Free Edge-Bundling for Interactive Graph Visualization
—Graph visualization has been widely used to understand and present both global structural and local adjacency information in relational datasets (e.g., transportation networks, ...
Sheng-Jie Luo, Chun-Liang Liu, Bing-Yu Chen, Kwan-...
CVPR
2008
IEEE
16 years 4 months ago
Graph commute times for image representation
We introduce a new image representation that encompasses both the general layout of groups of quantized local invariant descriptors as well as their relative frequency. A graph of...
Nikos Paragios, Regis Behmo, Véronique Prin...