An extraction method of solid line graph elements in mathematical graphs for automating translation of tactile graphics.
Jianjun ChenRyoji NagayaNoboru TakagiPublished in: SCIS&ISIS (2012)
Keyphrases
- graph structure
- graph theory
- graph representation
- directed graph
- weighted graph
- labeled graphs
- graph construction
- graph mining
- graph matching
- graph theoretic
- adjacency matrix
- series parallel
- graph classification
- graph model
- graph partitioning
- graph databases
- graph structures
- subgraph isomorphism
- bipartite graph
- graph data
- graph properties
- graph search
- graph kernels
- random graphs
- graph theoretical
- graph transformation
- dense subgraphs
- graph clustering
- undirected graph
- evolving graphs
- maximum clique
- multimedia
- graph isomorphism
- reachability queries
- structural pattern recognition
- maximum common subgraph
- connected dominating set
- neighborhood graph
- graph patterns
- connected graphs
- massive graphs
- average degree
- dynamic graph
- graph layout
- graph drawing
- disk resident
- polynomial time complexity
- spanning tree
- real world graphs
- rewriting rules
- directed acyclic
- graph representations
- inexact graph matching
- connected components
- machine translation
- structured data
- random walk
- minimum spanning tree
- association graph
- topological information
- planar graphs
- social graphs
- proximity graph
- fully connected
- computer graphics
- strongly connected
- maximum independent set
- maximal cliques
- small world
- bounded degree
- community discovery
- attributed graphs