Computing the boxicity of a graph by covering its complement by cointerval graphs.
Margaret B. CozzensFred S. RobertsPublished in: Discret. Appl. Math. (1983)
Keyphrases
- graph representation
- graph theory
- graph structure
- directed graph
- graph matching
- graph model
- graph databases
- weighted graph
- adjacency matrix
- labeled graphs
- graph theoretical
- graph theoretic
- graph construction
- series parallel
- graph mining
- random graphs
- graph classification
- graph structures
- graph properties
- subgraph isomorphism
- graph search
- graph clustering
- spanning tree
- bipartite graph
- graph data
- graph partitioning
- graph representations
- connected dominating set
- inexact graph matching
- structural pattern recognition
- dynamic graph
- undirected graph
- graph kernels
- graph drawing
- social graphs
- graph isomorphism
- maximum common subgraph
- maximum cardinality
- real world graphs
- graph layout
- dense subgraphs
- graph transformation
- finding the shortest path
- query graph
- edge weights
- planar graphs
- connected graphs
- average degree
- reachability queries
- proximity graph
- minimum spanning tree
- graph patterns
- homology generators
- directed acyclic
- neighborhood graph
- maximum independent set
- relational structures
- spectral decomposition
- evolving graphs
- hyper graph
- structured data
- maximum clique
- connected components
- community discovery
- random walk