221 search results - page 3 / 45 » Graph matching with type constraints on nodes and edges |
GD
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. The typical use of force-directed layout is to create organiclooking, straight-edge drawings of large graphs while combinatorial techniques are generally preferred for hi...
CP
2009
Springer
14 years 8 months ago
2009
Springer
Measuring graph similarity is a key issue in many applications. We propose a new constraint-based modeling language for defining graph similarity measures by means of constraints. ...
COMPSAC
2009
IEEE
14 years 2 months ago
2009
IEEE
—This paper considers the task of software test case generation from a large space of values of input parameters. The purpose of the paper is to create a model of software input ...
ICDE
2008
IEEE
14 years 9 months ago
2008
IEEE
Abstract-- Large graph datasets are common in many emerging database applications, and most notably in large-scale scientific applications. To fully exploit the wealth of informati...
PKDD
2009
Springer
14 years 2 months ago
2009
Springer
We propose a new, recursive model to generate realistic graphs, evolving over time. Our model has the following properties: it is (a) flexible, capable of generating the cross pro...