![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
8. GbRPR 2013: Vienna, Austria
- Walter G. Kropatsch, Nicole M. Artner, Yll Haxhimusa, Xiaoyi Jiang:
Graph-Based Representations in Pattern Recognition - 9th IAPR-TC-15 International Workshop, GbRPR 2013, Vienna, Austria, May 15-17, 2013. Proceedings. Lecture Notes in Computer Science 7877, Springer 2013, ISBN 978-3-642-38220-8 - Mario Vento:
A One Hour Trip in the World of Graphs, Looking at the Papers of the Last Ten Years. 1-10 - Nicholas Dahm, Horst Bunke, Terry Caelli
, Yongsheng Gao
:
A Unified Framework for Strengthening Topological Node Features and Its Application to Subgraph Isomorphism Detection. 11-20 - Christine Solnon, Guillaume Damiand
, Colin de la Higuera, Jean-Christophe Janodet:
On the Complexity of Submap Isomorphism. 21-30 - Fernand Meyer:
Flooding Edge Weighted Graphs. 31-40 - Bo Jiang, Jin Tang, Bin Luo
:
Graph Matching with Nonnegative Sparse Model. 41-50 - Francisco Escolano, Edwin R. Hancock
, Boyan Bonev, Miguel Angel Lozano
:
TurboTensors for Entropic Image Comparison. 51-60 - Xavier Cortés
, Francesc Serratosa
:
Active-Learning Query Strategies Applied to Select a Graph Node Given a Graph Labelling. 61-70 - Mohamed Amine Hannachi, Ismael Bouassida Rodriguez, Khalil Drira, Saúl E. Pomares Hernández
:
GMTE: A Tool for Graph Transformation and Exact/Inexact Graph Matching. 71-80 - Donatello Conte
, Jean-Yves Ramel
, Nicolas Sidere, Muhammad Muzzamil Luqman
, Benoit Gaüzère, Jaume Gibert, Luc Brun
, Mario Vento:
A Comparison of Explicit and Implicit Graph Embedding Methods for Pattern Recognition. 81-90 - Fernand Meyer:
Adjunctions on the Lattice of Dendrograms. 91-100 - Luca Rossi
, Andrea Torsello
, Edwin R. Hancock
:
A Continuous-Time Quantum Walk Kernel for Unattributed Graphs. 101-110 - Benoit Gaüzère, Luc Brun
, Didier Villemin:
Relevant Cycle Hypergraph Representation for Molecules. 111-120 - Lu Bai, Edwin R. Hancock
, Andrea Torsello
, Luca Rossi
:
A Quantum Jensen-Shannon Graph Kernel Using the Continuous-Time Quantum Walk. 121-131 - Pierre-Anthony Grenier, Luc Brun
, Didier Villemin:
Treelet Kernel Incorporating Chiral Information. 132-141 - Kaspar Riesen
, Sandro Emmenegger, Horst Bunke:
A Novel Software Toolkit for Graph Edit Distance Computation. 142-151 - Camille Combier, Guillaume Damiand
, Christine Solnon:
Map Edit Distance vs. Graph Edit Distance for Matching Images. 152-161 - Yao Lu, Horst Bunke, Cheng-Lin Liu:
An Algorithm for Maximum Common Subgraph of Planar Triangulation Graphs. 162-171 - Pablo Suau, Edwin R. Hancock
, Francisco Escolano:
Graph Characteristics from the Schrödinger Operator. 172-181 - Herbert Edelsbrunner:
Persistent Homology in Image Processing. 182-183 - Rocío González-Díaz, María José Jiménez
, Hamid Krim:
Towards Minimal Barcodes. 184-193 - Andreas Fischer, Ching Y. Suen, Volkmar Frinken, Kaspar Riesen
, Horst Bunke:
A Fast Matching Algorithm for Graph-Based Handwriting Recognition. 194-203 - Samuel de Sousa
, Nicole M. Artner, Walter G. Kropatsch:
On the Evaluation of Graph Centrality for Shape Matching. 204-213 - Aline Deruyver, Yann Hodé:
Shape Recognition as a Constraint Satisfaction Problem. 214-223 - Furqan Aziz
, Richard C. Wilson, Edwin R. Hancock
:
Gaussian Wave Packet on a Graph. 224-233 - Zhengwang Wu
, Xiaoyi Jiang
, Nanning Zheng, Yuehu Liu, Da-Chuan Cheng:
Exact Computation of Median Surfaces Using Optimal 3D Graph Search. 234-243 - Samuel de Sousa
, Yll Haxhimusa, Walter G. Kropatsch:
Estimation of Distribution Algorithm for the Max-Cut Problem. 244-253
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.