Sciweavers

3105 search results - page 77 / 621
» The Path-Packing Structure of Graphs
Sort
View
CORR
2011
Springer
358views Education» more  CORR 2011»
14 years 10 months ago
Time-Varying Graphs and Social Network Analysis: Temporal Indicators and Metrics
Abstract. Most instruments - formalisms, concepts, and metrics for social networks analysis fail to capture their dynamics. Typical systems exhibit different scales of dynamics, ra...
Nicola Santoro, Walter Quattrociocchi, Paola Flocc...
CGF
2011
14 years 6 months ago
Dynamic Insets for Context-Aware Graph Navigation
Maintaining both overview and detail while navigating in graphs, such as road networks, airline route maps, or social networks, is difficult, especially when targets of interest ...
S. Ghani, N. Henry Riche, N. Elmqvist
TVCG
2012
196views Hardware» more  TVCG 2012»
13 years 5 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-...
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
13 years 5 months ago
Ego-centric Graph Pattern Census
—There is increasing interest in analyzing networks of all types including social, biological, sensor, computer, and transportation networks. Broadly speaking, we may be interest...
Walaa Eldin Moustafa, Amol Deshpande, Lise Getoor
COMPGEOM
2010
ACM
15 years 8 months ago
Adding one edge to planar graphs makes crossing number hard
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
Sergio Cabello, Bojan Mohar