1154 search results - page 27 / 231 » On the editing distance of graphs |
EJC
2000
13 years 8 months ago
2000
WG
2001
Springer
14 years 1 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...
SAC
2011
ACM
12 years 11 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...
JEA
2008
13 years 8 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...
CIAC
1997
Springer
14 years 25 days 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...