221 search results - page 20 / 45 » Graph matching with type constraints on nodes and edges |
GD
2003
Springer
14 years 26 days ago
2003
Springer
In this paper we consider the problem of drawing and displaying a series of related graphs, i.e., graphs that share all, or parts of the same node set. We present three algorithms...
DASFAA
2004
IEEE
13 years 11 months ago
2004
IEEE
In this paper, a State-Based Dynamic Transportation Network (SBDTN) model is presented, which can be used to describe the spatiotemporal aspect of temporally variable transportatio...
TSE
2008
13 years 7 months ago
2008
Neglected conditions are an important but difficult-to-find class of software defects. This paper presents a novel approach for revealing neglected conditions that integrates stati...
TALG
2011
13 years 2 months ago
2011
We consider the task of network exploration by a mobile agent (robot) with small memory. The agent has to traverse all nodes and edges of a network (represented as an undirected c...
JGAA
2007
13 years 7 months ago
2007
The cluster structure of many real-world graphs is of great interest, as the clusters may correspond e.g. to communities in social networks or to cohesive modules in software syst...