In this paper, we address the problem of measuring structural dissimilarity between two partial orders with n elements. We propose a structural dissimilarity measure, based on the distance between isomorphism classes of partial orders, and propose an interpretation in terms of graph theory. We give examples of structural dissimilarity computations, using a simulated annealing algorithm for numerical optimization
We study finite partial orders and the concept of indistinguishability. In particular, we focus on S...
In chemistry and computational biology, structural graph descriptors have been proven essential for ...
The paper presents a methodology for classifying three-way dissimilarity data, which are reconstruct...
summary:A distance between finite partially ordered sets is studied. It is a certain measure of the ...
Similarity of edge labeled graphs is considered in the sense of minimum squared distance between cor...
© 2017. This version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/...
AbstractThis paper is devoted to structural relations between types of dissimilarities and the corre...
We construct a monadic second-order sentence that characterizes the ternary relations that are the b...
For every connected graph G, a subgraph H of G is isometric if the distance between any two vertices...
Graph edit distance measures the distance between two graphs as the number of elementary operations ...
Quantifying the similarity between two graphs is a fundamental algorithmic problem at the heart of m...
summary:In 1986, Chartrand, Saba and Zou [3] defined a measure of the distance between (the isomorph...
AbstractBranching structures, alias topological tree structures are fundamental to any hierarchical ...
In chemistry and computational biology, structural graph descriptors have been proven essential for ...
In chemistry and computational biology, structural graph descriptors have been proven essential for ...
We study finite partial orders and the concept of indistinguishability. In particular, we focus on S...
In chemistry and computational biology, structural graph descriptors have been proven essential for ...
The paper presents a methodology for classifying three-way dissimilarity data, which are reconstruct...
summary:A distance between finite partially ordered sets is studied. It is a certain measure of the ...
Similarity of edge labeled graphs is considered in the sense of minimum squared distance between cor...
© 2017. This version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/...
AbstractThis paper is devoted to structural relations between types of dissimilarities and the corre...
We construct a monadic second-order sentence that characterizes the ternary relations that are the b...
For every connected graph G, a subgraph H of G is isometric if the distance between any two vertices...
Graph edit distance measures the distance between two graphs as the number of elementary operations ...
Quantifying the similarity between two graphs is a fundamental algorithmic problem at the heart of m...
summary:In 1986, Chartrand, Saba and Zou [3] defined a measure of the distance between (the isomorph...
AbstractBranching structures, alias topological tree structures are fundamental to any hierarchical ...
In chemistry and computational biology, structural graph descriptors have been proven essential for ...
In chemistry and computational biology, structural graph descriptors have been proven essential for ...
We study finite partial orders and the concept of indistinguishability. In particular, we focus on S...
In chemistry and computational biology, structural graph descriptors have been proven essential for ...
The paper presents a methodology for classifying three-way dissimilarity data, which are reconstruct...