Abstract is missing.
- Saliency Detection via A Graph Based Diffusion ModelZhouqin He, Bo Jiang, Yun Xiao, Chris H. Q. Ding, Bin Luo. 3-12 [doi]
- Shape Simplification Through Graph SparsificationFrancisco Escolano, Manuel Curado, Silvia Biasotti, Edwin R. Hancock. 13-22 [doi]
- Reeb Graphs of Piecewise Linear FunctionsBarbara Di Fabio, Claudia Landi. 23-35 [doi]
- Learning from Diffusion-Weighted Magnetic Resonance Images Using Graph KernelsSylvain Takerkart, Gottfried Berton, Nicole Malfait, François-Xavier Dupé. 39-48 [doi]
- Learning Graph Matching with a Graph-Based Perceptron in a Classification ContextRomain Raveaux, Maxime Martineau, Donatello Conte, Gilles Venturini. 49-58 [doi]
- A Nested Alignment Graph Kernel Through the Dynamic Time Warping FrameworkLu Bai, Luca Rossi 0004, Lixin Cui, Edwin R. Hancock. 59-69 [doi]
- GERoMe - A Novel Graph Extraction Robustness MeasureDominik Drees, Aaron Scherzinger, Xiaoyi Jiang. 73-82 [doi]
- Speeding-Up Graph-Based Keyword Spotting in Historical Handwritten DocumentsMichael Stauffer, Andreas Fischer 0002, Kaspar Riesen. 83-93 [doi]
- Detecting Alzheimer's Disease Using Directed GraphsJianjia Wang, Richard C. Wilson, Edwin R. Hancock. 94-104 [doi]
- Error-Tolerant Coarse-to-Fine Matching Model for Hierarchical GraphsPau Riba, Josep Lladós, Alicia Fornés. 107-117 [doi]
- A Hungarian Algorithm for Error-Correcting Graph MatchingSébastien Bougleux, Benoit Gaüzère, Luc Brun. 118-127 [doi]
- Introducing VF3: A New Algorithm for Subgraph IsomorphismVincenzo Carletti, Pasquale Foggia, Alessia Saggese, Mario Vento. 128-139 [doi]
- Node Matching Computation Between Two Large Graphs in Linear Computational CostPep Santacruz, Shaima Algabli, Francesc Serratosa. 143-153 [doi]
- Measuring Vertex Centrality Using the Holevo QuantityLuca Rossi 0004, Andrea Torsello. 154-164 [doi]
- On the Interplay Between Strong Regularity and Graph DensificationMarco Fiorucci, Alessandro Torcinovich, Manuel Curado, Francisco Escolano, Marcello Pelillo. 165-174 [doi]
- Mining Frequent Patterns in 2D+t Grid Graphs for Cellular Automata AnalysisRomain Deville, Élisa Fromont, Baptiste Jeudy, Christine Solnon. 177-186 [doi]
- Density Normalization in Density Peak Based ClusteringJian Hou, Hongxia Cui. 187-196 [doi]
- Fast Nearest Neighbors Search in Graph Space Based on a Branch-and-Bound StrategyZeina Abu-Aisheh, Romain Raveaux, Jean-Yves Ramel. 197-207 [doi]
- Exact Computation of Graph Edit Distance for Uniform and Non-uniform Metric Edit CostsDavid B. Blumenthal, Johann Gamper. 211-221 [doi]
- Improved Graph Edit Distance Approximation with Simulated AnnealingKaspar Riesen, Andreas Fischer 0002, Horst Bunke. 222-231 [doi]
- An Edit Distance Between Graph CorrespondencesCarlos Francisco Moreno-García, Francesc Serratosa, Xiaoyi Jiang. 232-241 [doi]
- A Survey on Applications of Bipartite Graph Edit DistanceMichael Stauffer, Thomas Tschachtli, Andreas Fischer 0002, Kaspar Riesen. 242-252 [doi]
- Minimising Entropy Changes in Dynamic Network EvolutionJianjia Wang, Richard C. Wilson, Edwin R. Hancock. 255-265 [doi]
- Synchronization Over the Birkhoff Polytope for Multi-graph MatchingMichele Schiavinato, Andrea Torsello. 266-275 [doi]
- Adaptive Feature Selection Based on the Most Informative Graph-Based FeaturesLixin Cui, Yuhang Jiao, Lu Bai, Luca Rossi 0004, Edwin R. Hancock. 276-287 [doi]