Counting Plane Graphs: Cross-Graph Charging Schemes
Micha SharirAdam ShefferPublished in: CoRR (2012)
Keyphrases
- graph representation
- graph structure
- graph theoretic
- weighted graph
- graph matching
- graph theory
- graph construction
- labeled graphs
- directed graph
- graph classification
- graph model
- adjacency matrix
- graph structures
- graph mining
- graph theoretical
- graph properties
- graph databases
- series parallel
- graph clustering
- graph partitioning
- graph search
- undirected graph
- subgraph isomorphism
- structural pattern recognition
- random graphs
- bipartite graph
- graph representations
- graph isomorphism
- graph kernels
- graph transformation
- reachability queries
- average degree
- social graphs
- maximum common subgraph
- graph layout
- random walk
- spanning tree
- edge weights
- graph drawing
- maximum cardinality
- graph data
- community discovery
- massive graphs
- minimum spanning tree
- adjacency graph
- maximum clique
- fully connected
- finding the shortest path
- evolving graphs
- connected graphs
- attributed graphs
- disk resident
- dynamic graph
- spectral decomposition
- directed acyclic
- real world graphs
- graph embedding
- inexact graph matching
- maximum independent set
- maximal cliques
- shortest path
- web graph
- densely connected
- polynomial time complexity
- graph patterns
- neighborhood graph
- frequent subgraphs
- electric vehicles
- strongly connected
- topological information