Sciweavers

5473 search results - page 171 / 1095
» On the graph isomorphism problem
Sort
View
EOR
2007
69views more  EOR 2007»
15 years 7 months ago
The shortest multipaths problem in a capacitated dense channel
Abstract. In this paper, we present a simple polynomial-time algorithm solving the shortest multipaths problem in particular grid graphs called dense channels. Our work extends the...
Cédric Bentz, Marie-Christine Costa, Christ...
ALGORITHMICA
2004
153views more  ALGORITHMICA 2004»
15 years 7 months ago
Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem
We consider the problem of finding a minimum diameter spanning tree with maximum node degree B in a complete undirected edge-weighted graph. We provide an O( p logB n)-approximatio...
Jochen Könemann, Asaf Levin, Amitabh Sinha
ICASSP
2011
IEEE
14 years 10 months ago
The grouped two-sided orthogonal Procrustes problem
We pose a modified version of the two-sided orthogonal Procrustes problem subject to a grouping constraint, and offer an efficient solution method. This problem has applications...
Bryan R. Conroy, Peter J. Ramadge
CVPR
2003
IEEE
16 years 9 months ago
Many-to-Many Graph Matching via Metric Embedding
Graph matching is an important component in many object recognition algorithms. Although most graph matching algorithms seek a one-to-one correspondence between nodes, it is often...
Yakov Keselman, Ali Shokoufandeh, M. Fatih Demirci...
WWW
2008
ACM
16 years 7 months ago
Web graph similarity for anomaly detection (poster)
Web graphs are approximate snapshots of the web, created by search engines. Their creation is an error-prone procedure that relies on the availability of Internet nodes and the fa...
Panagiotis Papadimitriou 0002, Ali Dasdan, Hector ...