Partition graphs and coloring numbers of a graph.
E. SampathkumarV. N. BhavePublished in: Discret. Math. (1976)
Keyphrases
- graph representation
- graph theory
- graph structure
- directed graph
- vertex set
- graph matching
- weighted graph
- graph mining
- labeled graphs
- graph theoretic
- graph construction
- graph partitioning
- graph clustering
- graph model
- graph databases
- graph classification
- graph structures
- graph properties
- graph search
- partitioning algorithm
- graph data
- adjacency matrix
- subgraph isomorphism
- graph isomorphism
- undirected graph
- random graphs
- graph kernels
- spanning tree
- graph transformation
- series parallel
- adjacency graph
- bipartite graph
- inexact graph matching
- normalized cut
- maximum common subgraph
- topological information
- evolving graphs
- graph theoretical
- directed acyclic
- edge weights
- minimum spanning tree
- maximum independent set
- graph representations
- reachability queries
- planar graphs
- min cut
- web graph
- structural pattern recognition
- swendsen wang
- dynamic graph
- disk resident
- massive graphs
- connected dominating set
- real world graphs
- maximum clique
- social graphs
- random walk
- finding the shortest path
- graph layout
- attributed graphs
- graph drawing
- query graph
- proximity graph
- graph embedding
- polynomial time complexity
- connected components
- average degree
- strongly connected
- maximal cliques
- community discovery
- maximum cardinality
- connected graphs
- neighborhood graph
- graph patterns
- shortest path