1-perfectly orientable graphs and graph products.
Tatiana Romina HartingerMartin MilanicPublished in: Discret. Math. (2017)
Keyphrases
- graph matching
- graph theory
- graph structure
- directed graph
- graph representation
- weighted graph
- graph databases
- graph theoretic
- labeled graphs
- graph classification
- adjacency matrix
- graph mining
- graph construction
- graph structures
- graph properties
- graph clustering
- graph partitioning
- series parallel
- bipartite graph
- graph search
- structural pattern recognition
- graph model
- dynamic graph
- random graphs
- graph kernels
- subgraph isomorphism
- graph theoretical
- graph representations
- graph isomorphism
- edge weights
- graph transformation
- graph data
- spanning tree
- graph layout
- minimum spanning tree
- maximal cliques
- undirected graph
- maximum clique
- maximum common subgraph
- reachability queries
- social graphs
- attributed graphs
- inexact graph matching
- polynomial time complexity
- massive graphs
- directed acyclic
- small world
- dense subgraphs
- disk resident
- real world graphs
- web graph
- graph edit distance
- neighborhood graph
- association graph
- random walk
- spectral decomposition
- finding the shortest path
- connected graphs
- maximum cardinality
- maximum independent set
- planar graphs
- community discovery
- structured data
- complex networks
- graph patterns
- graph drawing
- strongly connected
- query graph
- hyper graph
- vertex set
- adjacency graph
- bounded degree
- quasi cliques
- graph embedding
- evolving graphs
- frequent subgraphs
- independent set
- link analysis
- pattern mining
- average degree