Local edge colouring of Yao-like subgraphs of Unit Disk Graphs.
Jurek CzyzowiczStefan DobrevEvangelos KranakisJaroslav OpatrnyJorge UrrutiaPublished in: Theor. Comput. Sci. (2009)
Keyphrases
- graph mining
- graph databases
- weighted graph
- subgraph isomorphism
- graph properties
- labeled graphs
- undirected graph
- subgraph matching
- graph structures
- maximum common subgraph
- connected subgraphs
- graph data
- reachability queries
- subgraph mining
- graph patterns
- graph theoretic
- vertex set
- query graph
- graph structure
- data structure
- frequent subgraph mining
- graph matching
- dense subgraphs
- graph theory
- minimum spanning trees
- frequent subgraphs
- edge detection
- maximum clique
- directed graph
- topological information
- edge detector
- edge information
- graph model
- pattern mining
- maximal cliques
- graph search
- graph representation
- graph partitioning
- spanning tree
- quasi cliques
- graph kernels
- random graphs
- complex networks
- query language