1154 search results - page 41 / 231 » On the editing distance of graphs |
155
click to vote
DAWAK
2000
Springer
15 years 6 months ago
2000
Springer
Abstract. Feature Extraction, also known as Multidimensional Scaling, is a basic primitive associated with indexing, clustering, nearest neighbor searching and visualization. We co...
118
click to vote
BMCBI
2010
15 years 2 months ago
2010
Background: Today it is common to apply multiple potentially conflicting data sources to a given phylogenetic problem. At the same time, several different inference techniques are...
ENDM
2007
15 years 1 months ago
2007
We survey recent results on a few distance labelling problems for hypercubes and Hamming graphs.
108
click to vote
WG
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. We study graph searching games where a number of cops try to capture a robber that is hiding in a system of tunnels modelled as a graph. While the current position of the...
115
click to vote
WG
1998
Springer
15 years 6 months ago
1998
Springer
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...