6598 search results - page 267 / 1320 » Graph Theory with Applications |
153
click to vote
DSD
2010
IEEE
15 years 6 months ago
2010
IEEE
—This paper presents an approximate Maximum Common Subgraph (MCS) algorithm, specifically for directed, cyclic graphs representing digital circuits. Because of the application d...
197
click to vote
JCP
2008
15 years 6 months ago
2008
Existing frequent subgraph mining algorithms can operate efficiently on graphs that are sparse, have vertices with low and bounded degrees, and contain welllabeled vertices and edg...
207
click to vote
TCS
2010
15 years 5 months ago
2010
We consider a graph-theoretical formalization of the process of gene assembly in ciliates introduced in Ehrenfeucht et al (2003), where a gene is modeled as a signed graph. The ge...
182
click to vote
ECEASST
2010
15 years 4 months ago
2010
Abstract. The precise specification of software models is a major concern in model-driven design of object-oriented software. In this paper, we investigate how program graphs, a la...
194
click to vote
ICIAP
2009
ACM
16 years 7 months ago
2009
ACM
Abstract. Being able to find the silhouette of an object is a very important front-end processing step for many high-level computer vision techniques, such as Shape-from-Silhouette...