1056 search results - page 126 / 212 » Constraint-Based Graph Matching |
122
click to vote
EVOW
2009
Springer
15 years 9 months ago
2009
Springer
We present a hybrid evolutionary algorithm for the graph coloring problem (Evocol). Evocol is based on two simple-but-effective ideas. First, we use an enhanced crossover that col...
135
Voted
GD
2000
Springer
15 years 6 months ago
2000
Springer
An orthogonal drawing of a graph is an embedding of the graph in the rectangular grid, with vertices represented by axis-aligned boxes, and edges represented by paths in the grid w...
116
click to vote
ESA
2008
Springer
15 years 4 months ago
2008
Springer
The edge asymmetry of a directed, edge-weighted graph is defined as the maximum ratio of the weight of antiparallel edges in the graph, and can be used as a measure of the heterog...
111
click to vote
ICWS
2008
IEEE
15 years 3 months ago
2008
IEEE
In this paper, we have studied a common Web service composition problem, the syntactic matching problem, where the output parameters of a Web service can be used as the input para...
TSE
2008
15 years 2 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...