The Normal Graph Conjecture for Two Classes of Sparse Graphs.
Anne BerryAnnegret WaglerPublished in: Graphs Comb. (2018)
Keyphrases
- directed acyclic
- graph structure
- graph theory
- gaussian graphical models
- weighted graph
- graph representation
- graph theoretic
- directed graph
- graph matching
- labeled graphs
- graph construction
- graph theoretical
- graph classification
- graph structures
- graph properties
- graph mining
- graph partitioning
- structural pattern recognition
- graph databases
- graph model
- bounded degree
- adjacency matrix
- graph data
- graph clustering
- bipartite graph
- spanning tree
- series parallel
- undirected graph
- graph search
- graph transformation
- random graphs
- inexact graph matching
- densely connected
- graph representations
- minimum spanning tree
- graphical models
- subgraph isomorphism
- connected dominating set
- graph kernels
- graph isomorphism
- graph layout
- edge weights
- maximum cardinality
- reachability queries
- high dimensional
- structured data
- evolving graphs
- dense subgraphs
- dynamic graph
- planar graphs
- bounded treewidth
- finding the shortest path
- query graph
- massive graphs
- maximum common subgraph
- connected graphs
- equivalence classes
- web graph
- neighborhood graph
- graph patterns
- polynomial time complexity
- disk resident
- pattern mining
- graph embedding
- community discovery
- maximum clique
- complex networks
- attributed relational graph
- graph drawing