The Normal Graph Conjecture for Classes of Sparse Graphs.
Anne BerryAnnegret WaglerPublished in: WG (2013)
Keyphrases
- directed acyclic
- graph structure
- graph representation
- graph theory
- graph databases
- weighted graph
- graph matching
- graph mining
- directed graph
- gaussian graphical models
- labeled graphs
- graph construction
- graphical models
- series parallel
- graph classification
- graph structures
- graph theoretic
- adjacency matrix
- graph theoretical
- graph properties
- graph model
- graph clustering
- graph data
- graph partitioning
- bipartite graph
- graph search
- undirected graph
- random graphs
- finding the shortest path
- densely connected
- dynamic graph
- reachability queries
- bounded degree
- graph representations
- spanning tree
- graph isomorphism
- subgraph isomorphism
- neighborhood graph
- graph transformation
- graph layout
- graph kernels
- structural pattern recognition
- evolving graphs
- connected dominating set
- topological information
- web graph
- edge weights
- small world
- graph drawing
- minimum spanning tree
- equivalence classes
- disk resident
- maximal cliques
- planar graphs
- connected graphs
- dense subgraphs
- maximum common subgraph
- structured data
- attributed graphs
- maximum cardinality
- community discovery
- social graphs
- real world graphs
- graph patterns
- directed acyclic graph
- random walk