1154 search results - page 27 / 231 » On the editing distance of graphs |
109
Voted
EJC
2000
15 years 1 months ago
2000
WG
2001
Springer
15 years 6 months ago
2001
Springer
In this work we introduce, characterize, and provide algorithmic results for (k, +)–distance-hereditary graphs, k ≥ 0. These graphs can be used to model interconnection networ...
151
click to vote
SAC
2011
ACM
14 years 4 months ago
2011
ACM
We propose a novel approach and tool for collaborative software engineering and development. In model-based software engineering, the underlying data structure is a complex, direc...
115
click to vote
JEA
2008
15 years 1 months ago
2008
As more and more genomes are sequenced, evolutionary biologists are becoming increasingly interested in evolution at the level of whole genomes, in scenarios in which the genome e...
122
click to vote
CIAC
1997
Springer
15 years 6 months ago
1997
Springer
In this paper, we study the Graph Isomorphism problem on graphs of bounded treewidth, bounded degree or bounded bandwidth. Graph Isomorphism can be solved in polynomial time for g...