Sciweavers

1327 search results - page 19 / 266
» Path following algorithm for the graph matching problem
Sort
View
TCS
2011
14 years 6 months ago
Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs
The problem of computing minimum distortion embeddings of a given graph into a line (path) was introduced in 2004 and has quickly attracted significant attention with subsequent ...
Pinar Heggernes, Daniel Meister, Andrzej Proskurow...
129
Voted
DKE
2007
199views more  DKE 2007»
14 years 11 months ago
QMatch - Using paths to match XML schemas
Integration of multiple heterogeneous data sources continues to be a critical problem for many application domains and a challenge for researchers world-wide. With the increasing ...
Naiyana Tansalarak, Kajal T. Claypool
DAGSTUHL
2007
15 years 1 months ago
Graph matching with type constraints on nodes and edges
Abstract. In this paper, we consider two particular problems of directed graph matching. The first problem concerns graphs with nodes that have been subdivided into classes of di...
Catherine Fraikin, Paul Van Dooren
COCOON
2006
Springer
15 years 3 months ago
A Detachment Algorithm for Inferring a Graph from Path Frequency
: Inferring graphs from path frequency has been studied as an important problem which has a potential application to drug design and elucidation of chemical structures. Given a mul...
Hiroshi Nagamochi
SODA
2008
ACM
135views Algorithms» more  SODA 2008»
15 years 1 months ago
Improved algorithms for orienteering and related problems
In this paper we consider the orienteering problem in undirected and directed graphs and obtain improved approximation algorithms. The point to point-orienteering-problem is the f...
Chandra Chekuri, Nitish Korula, Martin Pál