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