Sciweavers

1154 search results - page 41 / 231
» On the editing distance of graphs
Sort
View
DAWAK
2000
Springer
14 years 1 months ago
COFE: A Scalable Method for Feature Extraction from Complex Objects
Abstract. Feature Extraction, also known as Multidimensional Scaling, is a basic primitive associated with indexing, clustering, nearest neighbor searching and visualization. We co...
Gabriela Hristescu, Martin Farach-Colton
BMCBI
2010
137views more  BMCBI 2010»
13 years 8 months ago
TreeGraph 2: Combining and visualizing evidence from different phylogenetic analyses
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...
Ben C. Stöver, Kai F. Müller
ENDM
2007
100views more  ENDM 2007»
13 years 8 months ago
Distance Labelling Problems for Hypercubes and Hamming Graphs - A Survey
We survey recent results on a few distance labelling problems for hypercubes and Hamming graphs.
Sanming Zhou
WG
2009
Springer
14 years 3 months ago
Distance d-Domination Games
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...
Stephan Kreutzer, Sebastian Ordyniak
WG
1998
Springer
14 years 28 days ago
Graphs with Bounded Induced Distance
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...
Serafino Cicerone, Gabriele Di Stefano