Sciweavers

654 search results - page 71 / 131
» Matrix Graph Grammars
Sort
View
149
Voted
FCT
2003
Springer
15 years 9 months ago
Graph Searching, Elimination Trees, and a Generalization of Bandwidth
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle
120
Voted
DATE
2007
IEEE
92views Hardware» more  DATE 2007»
15 years 10 months ago
Random sampling of moment graph: a stochastic Krylov-reduction algorithm
In this paper we introduce a new algorithm for model order reduction in the presence of parameter or process variation. Our analysis is performed using a graph interpretation of t...
Zhenhai Zhu, Joel R. Phillips
127
Voted
GBRPR
2005
Springer
15 years 9 months ago
Towards Unitary Representations for Graph Matching
In this paper we explore how a spectral technique suggested by quantum walks can be used to distinguish non-isomorphic cospectral graphs. Reviewing ideas from the field of quantum...
David Emms, Simone Severini, Richard C. Wilson, Ed...
142
Voted
ECCC
2006
112views more  ECCC 2006»
15 years 3 months ago
Faster algorithms for finding lowest common ancestors in directed acyclic graphs
We present two new methods for finding a lowest common ancestor (LCA) for each pair of vertices of a directed acyclic graph (dag) on n vertices and m edges. The first method is su...
Artur Czumaj, Miroslaw Kowaluk, Andrzej Lingas
196
Voted
CVPR
2009
IEEE
16 years 11 months ago
A Tensor-Based Algorithm for High-Order Graph Matching
This paper addresses the problem of establishing correspondences between two sets of visual features using higher-order constraints instead of the unary or pairwise ones used in...
Francis R. Bach, In-So Kweon, Jean Ponce, Olivier ...