Sciweavers

3265 search results - page 182 / 653
» Representing Groups on Graphs
Sort
View
CSMR
1999
IEEE
15 years 8 months ago
Impact of Function Pointers on the Call Graph
Maintenance activities are made more difficult when pointers are heavily used in source code: the programmer needs to build a mental model of memory locations and of the way they ...
Giuliano Antoniol, F. Calzolari, Paolo Tonella
VISSYM
2007
15 years 6 months ago
Grouse: Feature-Based, Steerable Graph Hierarchy Exploration
Grouse is a feature-based approach to steerable exploration of a graph and an associated hierarchy. Steerability allows exploration to begin immediately, rather than requiring a c...
Daniel Archambault, Tamara Munzner, David Auber
SSDBM
2010
IEEE
185views Database» more  SSDBM 2010»
15 years 2 months ago
DESSIN: Mining Dense Subgraph Patterns in a Single Graph
Currently, a large amount of data can be best represented as graphs, e.g., social networks, protein interaction networks, etc. The analysis of these networks is an urgent research ...
Shirong Li, Shijie Zhang, Jiong Yang
WG
2010
Springer
15 years 2 months ago
Graphs with Large Obstacle Numbers
Motivated by questions in computer vision and sensor networks, Alpert et al. [3] introduced the following definitions. Given a graph G, an obstacle representation of G is a set of...
Padmini Mukkamala, János Pach, Deniz Sari&o...
COMPGEOM
2011
ACM
14 years 8 months ago
Integer representations of convex polygon intersection graphs
Abstract. We study the grid size that is needed to represent intersection graphs of convex polygons. Here the polygons are similar to a base polygon P whose corners have rational c...
Tobias Müller, Erik Jan van Leeuwen, Jan van ...