Sciweavers

708 search results - page 2 / 142
» A study of graph spectra for comparing graphs and trees
Sort
View
EVOW
2006
Springer
13 years 8 months ago
A Comparative Study of Ant Colony Optimization and Reactive Search for Graph Matching Problems
Many applications involve matching two graphs in order to identify their common features and compute their similarity. In this paper, we address the problem of computing a graph si...
Olfa Sammoud, Sébastien Sorlin, Christine S...
ISBRA
2009
Springer
13 years 11 months ago
Untangling Tanglegrams: Comparing Trees by Their Drawings
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology – to compare evolutiona...
Balaji Venkatachalam, Jim Apple, Katherine St. Joh...
EMMCVPR
2005
Springer
13 years 10 months ago
Retrieving Articulated 3-D Models Using Medial Surfaces and Their Graph Spectra
We consider the use of medial surfaces to represent symmetries of cts. This allows for a qualitative abstraction based on a directed acyclic graph of components and also a degree o...
Juan Zhang, Kaleem Siddiqi, Diego Macrini, Ali Sho...
DAM
2008
109views more  DAM 2008»
13 years 4 months ago
Minimal comparability completions of arbitrary graphs
A transitive orientation of an undirected graph is an assignment of directions to its edges so that these directed edges represent a transitive relation between the vertices of th...
Pinar Heggernes, Federico Mancini, Charis Papadopo...
DAM
2010
132views more  DAM 2010»
13 years 4 months ago
Homomorphisms of 2-edge-colored graphs
In this paper, we study homomorphisms of 2-edge-colored graphs, that is graphs with edges colored with two colors. We consider various graph classes (outerplanar graphs, partial 2...
Amanda Montejano, Pascal Ochem, Alexandre Pinlou, ...