Add to ORKGSummary. Two types of a distance between isomorphism classes of graphs are adapted for rooted trees
summary:Edge shift distance between isomorphism classes of graphs, introduced by M. Johnson, is inve...
In this paper, we study the Graph Isomorphism problem on graphs of bounded treewidth, bounded degree...
summary:In 1986, Chartrand, Saba and Zou [3] defined a measure of the distance between (the isomorph...
summary:Two types of a distance between isomorphism classes of graphs are adapted for rooted trees
summary:Two types of a distance between isomorphism classes of graphs are adapted for rooted trees
summary:Two types of a distance between isomorphism classes of graphs are adapted for rooted trees
summary:Edge shift distance between isomorphism classes of graphs, introduced by M. Johnson, is inve...
summary:In 1986, Chartrand, Saba and Zou [3] defined a measure of the distance between (the isomorph...
A new distance metric for rooted trees is presented which is based on the largest common forest of ...
AbstractWe investigate three metrics on the isomorphism classes of graphs derived from elementary ed...
A new distance metric for rooted trees is presented which is based on the largest common forest of ...
A new distance metric for rooted trees is presented which is based on the largest common forest of t...
This chapter describes distances between isomorphism classes or distances between graphs. An isomorp...
here edge-distance) between isomorphism classes of graphs, based on the maximum number of edges of c...
We investigate three metrics on the isomorphism classes of graphs derived from elementary edge opera...
summary:Edge shift distance between isomorphism classes of graphs, introduced by M. Johnson, is inve...
In this paper, we study the Graph Isomorphism problem on graphs of bounded treewidth, bounded degree...
summary:In 1986, Chartrand, Saba and Zou [3] defined a measure of the distance between (the isomorph...
summary:Two types of a distance between isomorphism classes of graphs are adapted for rooted trees
summary:Two types of a distance between isomorphism classes of graphs are adapted for rooted trees
summary:Two types of a distance between isomorphism classes of graphs are adapted for rooted trees
summary:Edge shift distance between isomorphism classes of graphs, introduced by M. Johnson, is inve...
summary:In 1986, Chartrand, Saba and Zou [3] defined a measure of the distance between (the isomorph...
A new distance metric for rooted trees is presented which is based on the largest common forest of ...
AbstractWe investigate three metrics on the isomorphism classes of graphs derived from elementary ed...
A new distance metric for rooted trees is presented which is based on the largest common forest of ...
A new distance metric for rooted trees is presented which is based on the largest common forest of t...
This chapter describes distances between isomorphism classes or distances between graphs. An isomorp...
here edge-distance) between isomorphism classes of graphs, based on the maximum number of edges of c...
We investigate three metrics on the isomorphism classes of graphs derived from elementary edge opera...
summary:Edge shift distance between isomorphism classes of graphs, introduced by M. Johnson, is inve...
In this paper, we study the Graph Isomorphism problem on graphs of bounded treewidth, bounded degree...
summary:In 1986, Chartrand, Saba and Zou [3] defined a measure of the distance between (the isomorph...